Journal of Automated Reasoning
Paraconsistent logic programming
Theoretical Computer Science
RI: A logic for reasoning with inconsistency
Proceedings of the Fourth Annual Symposium on Logic in computer science
Paraconsistent disjunctive deductive databases
Theoretical Computer Science
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
A theory of nonmonotonic inheritance based on annotated logic
Artificial Intelligence
A logic for reasoning with inconsistency
Journal of Automated Reasoning
Automated deduction in multiple-valued logics
Automated deduction in multiple-valued logics
Resolution Strategies as Decision Procedures
Journal of the ACM (JACM)
A Framework for Automated Reasoning in Multiple-Valued Logics
Journal of Automated Reasoning
IEEE Transactions on Knowledge and Data Engineering
On the Semantics of Rule-Based Expert Systems with Uncertainty
ICDT '88 Proceedings of the 2nd International Conference on Database Theory
Omega-Resolution: An Inference Rule for Regular Multiple-Valued Logics
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
KOMET - A System for the Integration of Heterogeneous Information Sources
ISMIS '97 Proceedings of the 10th International Symposium on Foundations of Intelligent Systems
Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
A Foundation for Hybrid Knowledge Bases
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Search Strategies for Annotated Logics over Distributive Lattices
Search Strategies for Annotated Logics over Distributive Lattices
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
The inference rule 驴-resolution was introduced in [18] as a technique for developing an SLD-style query answering procedure for the logic programming subset of annotated logic. This paper explores the properties of 驴-resolution in the general theorem proving setting. In that setting, it is shown to be complete and to admit a linear restriction. Thus 驴-resolution is amenable to depth-first control strategies that require little memory. An ordering restriction is also described and shown to be complete, providing a promising saturation-based procedure for annotated logic. The inference rule essentially requires that the lattice of truth values be ordinary. Earlier investigations left open the question of whether all distributive lattices are ordinary; this is answered in the affirmative here.