A Framework for Automated Reasoning in Multiple-Valued Logics

Authors:
James J. Lu;Neil V. Murray;Erik Rosenthal
Affiliations:
Department of Computer Science, Bucknell University, Lewisburg, PA 17838. e-mail:jameslu@bucknell.edu;Department of Computer Science, State University of New York, Albany, NY 12222. e-mail:nvm@cs.albany.edu;Department of Mathematics, University of New Haven, West Haven, CT 06516. e-mail:brodsky@charger.newhaven.edu
Venue:
Journal of Automated Reasoning
Year:
1998

Citing 14
Cited 13

First-order modal tableaux

Journal of Automated Reasoning
The semantics of non-monotonic entailment defined using partial interpretations

Proceedings of the 2nd international workshop on Non-monotonic reasoning
Paraconsistent logic programming

Theoretical Computer Science
&Lgr;-resolution and interpretation of &Lgr;-implication in fuzzy operator logic

Information Sciences: an International Journal
Paraconsistent disjunctive deductive databases

Theoretical Computer Science
Theory of generalized annotated logic programming and its applications

Journal of Logic Programming
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 Linear Format for Resolution With Merging and a New Technique for Establishing Completeness

Journal of the ACM (JACM)
Fuzzy Logic and the Resolution Principle

Journal of the ACM (JACM)
Signed Formulas and Fuzzy Operator Logics

ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Resolution and Path Dissolution in Multi-Valued Logics

ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics

CSL '90 Proceedings of the 4th Workshop on Computer Science Logic

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

JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
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
Filter-based resolution principle for lattice-valued propositional logic LP(X)

Information Sciences: an International Journal
Automated theorem proving by resolution in non-classical logics

Annals of Mathematics and Artificial Intelligence
A Sequent Calculus for Bilattice-Based Logic and Its Many-Sorted Representation

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
On the refutational completeness of signed binary resolution and hyperresolution

Fuzzy Sets and Systems
Fuzzy logic from the viewpoint of machine intelligence

Fuzzy Sets and Systems
Determination of α-resolution in lattice-valued first-order logic LF(X)

Information Sciences: an International Journal
α-Lock resolution method for a lattice-valued first-order logic

Engineering Applications of Artificial Intelligence
Resolution procedures for multiple-valued optimization

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The language of signed formulas offers a first-order classical logicframework for automated reasoning in multiple-valued logics. It issufficiently general to include both annotated logics and fuzzy operatorlogics. Signed resolution unifies the two inference rules of annotatedlogics, thus enabling the development of an SLD-style proof procedure forannotated logic programs. Signed resolution also captures fuzzy resolution.The logic of signed formulas offers a means of adapting most classicalinference techniques to multiple-valued logics.