Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Readings in nonmonotonic reasoning
Extended stable semantics for normal and disjunctive programs
Logic programming
Logic programs with classical negation
Logic programming
Logic programs with exceptions
Logic programming
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Information and Computation
Bilattices and the semantics of logic programming
Journal of Logic Programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Well founded semantics for logic programs with explicit negation
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Kleene's three valued logics and their children
Fundamenta Informaticae
General patterns in nonmonotonic reasoning
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Combining knowledge with many-valued logics
Data & Knowledge Engineering - Special issue: distributed expertise
Artificial Intelligence
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
A Model Theory for Paraconsistent Logic Programming
EPIA '95 Proceedings of the 7th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
How to infer from inconsistent beliefs without revising
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A uniform approach to logic programming semantics
Theory and Practice of Logic Programming
Any-world assumptions in logic programming
Theoretical Computer Science
Epistemic foundation of stable model semantics
Theory and Practice of Logic Programming
Foundations of Paraconsistent Resolution
Fundamenta Informaticae
A paraconsistent logic programming approach for querying inconsistent databases
International Journal of Approximate Reasoning
A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Quasi-Classical Model Semantics for Logic Programs --- A Paraconsistent Approach
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Proof theory of Nelson's paraconsistent logic: A uniform perspective
Theoretical Computer Science
Living with inconsistency and taming nonmonotonicity
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Foundations of Paraconsistent Resolution
Fundamenta Informaticae
| Hi-index | 0.01 |
We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negation and a negation-by-failure. The programs may also be prioritized, that is, their clauses may be arranged in a partial order that reflects preferences among the corresponding rules. This yields a robust framework for representing knowledge in logic programs with a considerable expressive power. The declarative semantics for such programs is particularly suitable for reasoning with uncertainty, in the sense that it pinpoints the incomplete and inconsistent parts of the data, and regards the remaining information as classically consistent. As such, this semantics allows to draw conclusions in a non-trivial way, even in cases that the logic programs under consideration are not consistent. Finally, we show that this formalism may be regarded as a simple and flexible process for belief revision.