Automated theorem proving by resolution in non-classical logics

Authors:
Viorica Sofronie-Stokkermans
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany D-66123
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2007

Citing 20
Cited 5

Satisfiability in many-valued sentential logic is NP-complete

Theoretical Computer Science
A logic for reasoning with inconsistency

Journal of Automated Reasoning
Resolution-based theorem proving for many-valued logics

Journal of Symbolic Computation
Resolution and model building in the infinite-valued calculus of Łukasiewicz

Theoretical Computer Science
Ordered chaining calculi for first-order theories of transitive relations

Journal of the ACM (JACM)
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modal logic

Modal logic
Tarskian set constraints

Information and Computation
A Framework for Automated Reasoning in Multiple-Valued Logics

Journal of Automated Reasoning
Decidability by Resolution for Propositional Modal Logics

Journal of Automated Reasoning
Finiteness in Infinite-Valued Σukasiewicz Logic

Journal of Logic, Language and Information
On Uniform Word Problems Involving Bridging Operators on Distributive Lattices

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Automated deduction for many-valued logics

Handbook of automated reasoning
A Superposition Decision Procedure for the Guarded Fragment with Equality

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Transformations between Signed and Classical Clause Logic

ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Chaining Techniques for Automated Theorem Proving in Many-Valued Logics

ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
The 2-SAT Problem of Regular Signed CNF Formulas

ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
Complexity of many-valued logics

Beyond two
Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators

Journal of Symbolic Computation
Terminological cycles in a description logic with existential restrictions

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Modal Semirings Revisited

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
On the refutational completeness of signed binary resolution and hyperresolution

Fuzzy Sets and Systems
Distributive lattice-structured ontologies

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Internal axioms for domain semirings

Science of Computer Programming
Determination of α-resolution in lattice-valued first-order logic LF(X)

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is an overview of a variety of results, all centered around a common theme, namely embedding of non-classical logics into first order logic and resolution theorem proving. We present several classes of non-classical logics, many of which are of great practical relevance in knowledge representation, which can be translated into tractable and relatively simple fragments of classical logic. In this context, we show that refinements of resolution can often be used successfully for automated theorem proving, and in many interesting cases yield optimal decision procedures.