Defeasible reasoning and decision support systems
Decision Support Systems
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
On the declarative semantics of logic programs with negation
Foundations of deductive databases and logic programming
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Representation results for defeasible logic
ACM Transactions on Computational Logic (TOCL)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Propositional defeasible logic has linear complexity
Theory and Practice of Logic Programming
On the problem of computing ambiguity propagation and well-founded semantics in defeasible logic
RuleML'10 Proceedings of the 2010 international conference on Semantic web rules
What are the necessity rules in defeasible reasoning?
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Hi-index | 0.00 |
Due to its efficiency, defeasible logic is one of the most interesting non-monotonic formalisms. Unfortunately, the logic has one major limitation: it does not properly deal with cyclic defeasible rules.In this paper, we provide a new variant of defeasible logic, using CAKE method. The resulting formalism is tractable and properly deals with circular defeasible rules.