Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Reasoning about knowledge: an overview
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Realizability semantics for error-tolerant logics
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Theoretical foundations for belief revision
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Deleting Repeated Goals in the Problem Reduction Format
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
A hole in goal trees: some guidance from resolution theory
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
| Hi-index | 0.00 |
In this paper, we propose a logic which is nontrivial in the presence of inconsistency. The logic is based on the resolution principle and coincides with the classical logic when premises are consistent. Some results of interesting to Automated Theorem Proving are a sound and sometimes complete three-valued semantics for the resolution rule and a refutation process which is much in the spirit of the problem reduction format.