Automated Deduction for Deontic Logics: Laying the Foundations of Legal Expert Systems
نویسنده
چکیده
ABSTRACT: Deontic logic can be used to formalise legal rules. The automation of reasoning in deontic logic can therefore be used as the basis of a legal expert system. In this paper we investigate the automation of deontic logic using tableau calculi for modal logics. The correspondance between the deontic and modal logics is outlined and the tableau for the modal logics used in the prover are given. We also use some of the well known paradoxes of deontic logic to demonstrate the operation of an automated theorem prover for deontic logic.
منابع مشابه
Automated Reasoning for Robot Ethics
Deontic logic is a very well researched branch of mathematical logic and philosophy. Various kinds of deontic logics are considered for different application domains like argumentation theory, legal reasoning, and acts in multi-agent systems. In this paper, we show how standard deontic logic can be used to model ethical codes for multi-agent systems. Furthermore we show how Hyper, a high perfor...
متن کاملAutomated Reasoning in Deontic Logic
Deontic logic is a very well researched branch of mathematical logic and philosophy. Various kinds of deontic logics are discussed for different application domains like argumentation theory, legal reasoning, and acts in multi-agent systems. In this paper, we show how standard deontic logic can be stepwise transformed into description logic and DLclauses, such that it can be processed by Hyper,...
متن کاملGödel Logics: Foundations and Applications to Computer Science
Gödel logics are a family of many-valued logics which have recently received significant attention in Computer Science. They are one of the families of logics which have been used as a basis of fuzzy logic; they have been used to give characterizations of the stable model semantics in logic programming; and they have been put forward as candidates for a logical analysis of parallel computation....
متن کاملAutomated Reasoning over Deontic Action Logics with Finite Vocabularies
In this paper we investigate further the tableaux system for a deontic action logic we presented in previous work. This tableaux system uses atoms (of a given boolean algebra of action terms) as labels of formulae. This allows us to embrace parallel execution of actions and action complement, two action operators that may present difficulties in their treatment. One of the restrictions of this ...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کامل