Omega-Resolution: An Inference Rule for Regular Multiple-Valued Logics

Authors:
Sonia M. Leach;James J. Lu;Neil V. Murray;Erik Rosenthal
Affiliations:
-;-;-;-
Venue:
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Year:
1998

Citing 13
Cited 3

Multi-valued logics

Readings in nonmonotonic reasoning
First-order modal tableaux

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-based theorem proving for many-valued logics

Journal of Symbolic Computation
A Framework for Automated Reasoning in Multiple-Valued Logics

Journal of Automated Reasoning
Hybrid Knowledge Bases

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

Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics

ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Inference for Annotated Logics over Distributive Lattices

ISMIS '02 Proceedings of the 13th 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

Quantified Score

Hi-index	0.01

Visualization

Abstract

The inference rule Ω-resolution for regular multiple-valued logics is developed. One advantage of Ω-resolution is that linear, regular proofs are possible. That is, unlike existing deduction techniques, Ω-resolution admits input deductions (for Horn sets) while maintaining regular signs. More importantly, Ω-resolution proofs are at least as short as proofs for definite clauses generated by the standard inference techniques--annotated resolution and reduction--and pruning of the search space occurs automatically.