A Semi-Decision Procedure for the Functional Calculus
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Properties of Programs and the First-Order Predicate Calculus
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Journal of the ACM (JACM)
Using resolution for extending KL-ONE-type languages
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Structuring Resolution Proofs by Introducing New Lemmata
Journal of Automated Reasoning
An Algorithm for the Retrieval of Unifiers from Discrimination Trees
Journal of Automated Reasoning
Decidability by Resolution for Propositional Modal Logics
Journal of Automated Reasoning
Using Resolution for Testing Modal Satisfiability and Building Models
Journal of Automated Reasoning
Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Checking Consistency of Database Constraints: a Logical Basis
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Inference for Annotated Logics over Distributive Lattices
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Higher-Order Positive Set Constraints
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Issues of Decidability for Description Logics in the Framework of Resolution
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Ordered Resolution vs. Connection Graph Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Extracting models from clause sets saturated under semantic refinements of the resolution rule
Information and Computation
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
Resolution decision procedures
Handbook of automated reasoning
Combining superposition, sorts and splitting
Handbook of automated reasoning
First-order logic Davis-Putnam-Logemann-Loveland procedure
Exploring artificial intelligence in the new millennium
Constructing decision procedures in equational clausal logic
Fundamenta Informaticae
On redundancy elimination tolerant scheduling rules
Theory and Practice of Logic Programming
Representing and Building Models for Decidable Subclasses of Equational Clausal Logic
Journal of Automated Reasoning
A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$
Journal of Automated Reasoning
Deciding expressive description logics in the framework of resolution
Information and Computation
ACM Transactions on Computational Logic (TOCL)
Rewriting Conjunctive Queries over Description Logic Knowledge Bases
Semantics in Data and Knowledge Bases
Splitting without backtracking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Embedding deduction modulo into a prover
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
The data complexity of the syllogistic fragments of English
Proceedings of the 17th Amsterdam colloquium conference on Logic, language and meaning
Querying the fragments of english
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Ontological query answering via rewriting
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Unsorted Functional Translations
Electronic Notes in Theoretical Computer Science (ENTCS)
A resolution-based decision procedure for SHOIQ
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Finding finite herbrand models
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Constructing Decision Procedures in Equational Clausal Logic
Fundamenta Informaticae
| Hi-index | 0.01 |
The resolution principle, an automatic inference technique, is studied as a possible decision procedure for certain classes of first-order formulas. It is shown that most previous resolution strategies do not decide satisfiability even for “simple” solvable classes. Two new resolution procedures are described and are shown to be complete (i.e. semidecision procedures) in the general case and, in addition, to be decision procedures for successively wider classes of first-order formulas. These include many previously studied solvable classes. The proofs that a complete resolution procedure will always halt (without producing the empty clause) when applied to satisfiable formulas in certain classes provide new, and in some cases more enlightening, demonstrations of the solvability of these classes. A technique for constructing a model for a formula shown satisfiable in this way is also described.