Logic programs with classical negation
Logic programming
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
Well founded semantics for logic programs with explicit negation
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Skeptical reason maintenance and belief revision
Artificial Intelligence
An argumentation semantics for logic programming with explicit negation
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Scenario semantics of extended logic programs
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
The alternating fixpoint of logic programs with negation
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A three-valued semantics for deductive databases and logic programs
Journal of Computer and System Sciences
Iterative belief revision in extended logic programming
Theoretical Computer Science
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic Programming with Assumption Denials
ICLP '94/NMELP '94 Selected papers from the Workshop on Non-Monotonic Extensions of Logic Programming
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
An abductive framework for computing knowledge base updates
Theory and Practice of Logic Programming
On the notions of residuated-based coherence and bilattice-based consistence
WILF'11 Proceedings of the 9th international conference on Fuzzy logic and applications
| Hi-index | 0.00 |
In this paper, we present a new approach to the problem of revising extended programs; we base this approach on the coherence theory initially advocated by Gardenfors for belief revision. Our approach resolves contradiction by removing only conflicting information, not the believed source of it, and therefore, keeps information loss minimal. Furthermore, since there is no need to search for problematic assumptions, as is done in the traditional assumption-removal approach, our approach provides a skeptical revision semantics that is tractable. We define the skeptical and credulous coherence semantics and show that both semantics can be characterized in terms of the fixpoint semantics of a revised program using a simple program-revision technique. These semantics provide a suitable framework for knowledge and belief revision in the context of logic programs. Semantical properties and advantages of the proposed revision semantics are also analyzed.