The architecture of a reasoning system for Defeasible Deontic Logic

We present the architecture of Houdini-2.0, a reasoning system that computes the extension of a defeasible deontic theory given as We present the architecture of Houdini-2.0, a reasoning system that computes the extension of a defeasible deontic theory given as non-monotonic, and it allows us to determine which prescriptive behaviours are in force (obligations, permissions, prohibitions) input, the process of computing the consequences of the rules expressed in the theory itself. The decision process is a sceptical, input, the process of computing the consequences of the rules expressed in the theory itself. The decision process is a sceptical, along with propositional ones. The system is based on pre-existing algorithmic solutions, and it is implemented as an online platform non-monotonic, and it allows us to determine which prescriptive behaviours are in force (obligations, permissions, prohibitions) non-monotonic, and it allows us to determine which prescriptive behaviours are in force (obligations, permissions, prohibitions) to deploy the results of a computation in several use cases, including those that pertain legal domain. along with propositional ones. The system is based on pre-existing algorithmic solutions, and it is implemented as an online platform along with propositional ones. The system is based on pre-existing algorithmic solutions, and it is implemented as an online platform to deploy the results of a computation in several use cases, including those that pertain legal domain.