Reasoning about truth (research note)
Artificial Intelligence
Truth and meaning (research note)
Artificial Intelligence
Paraconsistent logic programming
Theoretical Computer Science
RI: A logic for reasoning with inconsistency
Proceedings of the Fourth Annual Symposium on Logic in computer science
Logic programs with classical negation
Logic programming
Y-logic: a framework for reasoning about chameleonic programs with inconsistent completions
Fundamenta Informaticae
A database needs two kinds of negation
MFDBS 91 Proceedings of the 3rd symposium on Mathematical fundamentals of database and knowledge base systems
Partiality, Truth and Persistence
Partiality, Truth and Persistence
Automatic Theorem Proving in Paraconsistent Logics: Theory and Implementation
Proceedings of the 10th International Conference on Automated Deduction
A Comparison of Sceptical NAF-Free Logic Programming Approaches
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Dialectic resoning with inconsistent information
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
Routley semantics for answer sets
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Hi-index | 0.00 |
In the logical semantics of knowledge bases (K8) the handling of contradictions poses a problem not solvable by standard logic. An adequate logic for KBs must be capable of tolerating inconsistency in a KB without losing its deductive content. This is also the bottom line of so-called paraconsistent logics. But paraconsistent logic does not address the question whether contradictory information should be accepted or not in the derivation of further information depending on it. We propose two computational logics based on the notions of support and acceptance handling contradictions in a conservative, resp. skeptical, manner: they neither lead to the break-down of the system nor are they accepted as valid pieces of information.