Embedding defeasible logic into logic programming
نویسندگان
چکیده
منابع مشابه
Embedding defeasible logic into logic programming
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper ...
متن کاملEmbedding Defeasible Logic into Logic Programs
(c) If D is decisive then the implications (a) and (b) are also true in the opposite direction. That is, if D is decisive, then the stable model semantics of P(D) corresponds to the provability in defeasible logic. However part (c) is not true in the general case, as the following example shows. Example 5. Consider the defeasible theory r 1 :) :p r 2 : p) p In defeasible logic, +@:p cannot be p...
متن کاملEmbedding Defeasible Logic Programs into Generalized Logic Programs
A novel argumentation semantics of defeasible logic programs (DeLP) is presented. Our goal is to build a semantics, which respects existing semantics and intuitions of “classical” logic programming. Generalized logic programs (GLP) are selected as an appropriate formalism for studying both undermining and rebutting. Our argumentation semantics is based on a notion of conflict resolution strateg...
متن کاملDefeasible Logic versus Logic Programming without Negation as Failure
A clash of intuitions: The current state of nonmonotonic multiple inheritance systems. 13 6 Conclusion We have looked at the relationship between four logic programming-based formalisms that employ a priority relation among rules and take a sceptical approach to inference. Three, defeasible logic, LPwNF and courteous logic programs, belong to the same \school" while priority logic takes a funda...
متن کاملEmbedding Description Logic Programs into Default Logic
Description logic programs (dl-programs) under the answer set semantics formulated by Eiter et al. have been considered as a prominent formalism for integrating rules and ontology knowledge bases. A question of interest has been whether dl-programs can be captured in a general formalism of nonmonotonic logic. In this paper, we study the possibility of embedding dl-programs into default logic. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2006
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068406002778