Extracting models from clause sets saturated under semantic refinements of the resolution rule

Authors:
Nicolas Peltier
Affiliations:
Centre National de la Recherche Scientifique, Laboratoire LEIBNIZ-IMAG, 46 Avenue Félix Viallet, 38031 Grenoble Cedex, France
Venue:
Information and Computation
Year:
2003

Citing 22
Cited 0

Explicit representation of terms defined by counter examples

Journal of Automated Reasoning
Equational problems anddisunification

Journal of Symbolic Computation
A method for simultaneous search for refutations and models by equational constraint solving

Journal of Symbolic Computation
First-order logic and automated theorem proving (2nd ed.)

First-order logic and automated theorem proving (2nd ed.)
Increasing model building capabilities by constraint solving on terms with integer exponents

Journal of Symbolic Computation
The resolution calculus

The resolution calculus
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution

Journal of the ACM (JACM)
Resolution Strategies as Decision Procedures

Journal of the ACM (JACM)
Combining enumeration and deductive techniques in order to increase the class of constructible infinite models

Journal of Symbolic Computation - Special issue on advances in first-order theorem proving
Resolution Methods for the Decision Problem

Resolution Methods for the Decision Problem
Using Resolution for Testing Modal Satisfiability and Building Models

Journal of Automated Reasoning
Decision Procedures Using Model Building Techniques

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Using Resolution for Deciding Solvable Classes and Building Finite Models

Baltic Computer Science, Selected Papers
A New Clausal Class Decidable by Hyperresolution

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
System Description: An Equational Constraints Solver

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A General Method for Using Schematizations in Automated Deduction

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
An Improved Lower Bound for the Elementary Theories of Trees

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Resolution decision procedures

Handbook of automated reasoning
A calculus combining resolution and enumeration for building finite models

Journal of Symbolic Computation - Special issue: First order theorem proving
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)
SEM: a system for enumerating models

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm that-given a set of clauses S saturated under some semantic refinements of the resolution calculus-automatically constructs a Herbrand model M of S. M is represented by a set of atoms with equality and disequality constraints interpreted over the finite tree algebra, hence the problem of evaluating first-order formulae in M is decidable.