Proceedings ArticleDOI
Efficient defeasible reasoning systems
Michael J. Maher,Andrew Rock,Grigoris Antoniou,David Billington,Tristan Miller +4 more
- pp 384-392
Reads0
Chats0
TLDR
It is believed that defeasible logic, with its efficiency and simplicity is a good candidate to be used as a modelling language for practical applications, including modelling of regulations and business rules.Abstract:
For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonic reasoning. In this work we discuss defeasible logic, a less-expressive but more efficient non-monotonic logic. We report on two new implemented systems for defeasible logic: a query answering system employing a backward chaining approach, and a forward-chaining implementation that computes all conclusions. Our experimental evaluation demonstrates that the systems can deal with large theories (up to hundreds of thousands of rules). We show that defeasible logic has linear complexity, which contrasts markedly with most other non-monotonic logics and helps to explain the impressive experimental results. We believe that defeasible logic, with its efficiency and simplicity is a good candidate to be used as a modelling language for practical applications, including modelling of regulations and business rules.read more
Citations
More filters
Journal ArticleDOI
Representation results for defeasible logic
TL;DR: In this article, transformations and normal forms in the context of defeasible logic have been investigated, a simple but efficient formalism for non-monotonic reasoning based on rules and priorities.
Journal ArticleDOI
REPRESENTING BUSINESS CONTRACTS IN RuleML
TL;DR: This paper presents an approach for the specification and implementation of translating contracts from a human-oriented form into an executable representation for monitoring in the setting of RuleML, and how to extend it to cover deontic and defeasible aspects of legal language.
Journal ArticleDOI
Propositional defeasible logic has linear complexity
TL;DR: Defeasible logic as discussed by the authors is a non-monotonic logic with both strict and defeasible rules and a priority relation on rules, and it is shown that inference in the propositional form can be performed in linear time.
Proceedings ArticleDOI
Temporalised normative positions in defeasible logic
TL;DR: A computationally oriented non-monotonic multi-modal logic arising from the combination of temporalised agency and temporalised normative positions is proposed and how to represent and reason with them in the setting of Defeasible Logic is shown.
Journal ArticleDOI
A normative framework for agent-based systems
TL;DR: The main objective is to present a formal normative framework for agent-based systems that facilitates their implementation and considers, in the model of normative multi-agent systems, the perspective of individual agents and what they might need to effectively reason about the society in which they participate.
References
More filters
Journal ArticleDOI
GOLOG: A logic programming language for dynamic domains
TL;DR: A new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world is proposed.
Journal ArticleDOI
Linear-time algorithms for testing the satisfiability of propositional horn formulae
William F. Dowling,Jean Gallier +1 more
TL;DR: The formulation of the satisfiability problem as a data flow problem appears to be new and suggests the possibility of improving efficiency using parallel processors.
Journal ArticleDOI
Argument-based extended logic programming with defeasible priorities
Henry Prakken,Giovanni Sartor +1 more
TL;DR: A semantics and proof theory of a system for defeasible argumentation in a logic-programming language with both weak and strong negation, where an argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks.
Journal ArticleDOI
Representing action and change by logic programs
TL;DR: The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past, and is proved to be sound relative to a semantics of action based on states and transition functions.