Artificial Intelligence
Equational problems anddisunification
Journal of Symbolic Computation
A transformational approach to negation in logic programming
Journal of Logic Programming
First-order logic and automated theorem proving
First-order logic and automated theorem proving
A method for simultaneous search for refutations and models by equational constraint solving
Journal of Symbolic Computation
Equational formulae with membership constraints
Information and Computation
Tree automata and automated model building
Fundamenta Informaticae
The resolution calculus
Resolution Methods for the Decision Problem
Resolution Methods for the Decision Problem
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Computational Representations of Herbrand Models Using Grammars
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
SEM: a system for enumerating models
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Representing and Building Models for Decidable Subclasses of Equational Clausal Logic
Journal of Automated Reasoning
Superposition for Fixed Domains
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Superposition for fixed domains
ACM Transactions on Computational Logic (TOCL)
Deciding the inductive validity of ∀∃* queries
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Finding finite herbrand models
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
A method is proposed to transform automatically some satisfiable clause sets S into clause sets S' having a unique Herbrand model (w.r.t. a given signature) which also satisfies S. These clause sets with only one model can be used as representations of (in general infinite) Herbrand models of the initial set of clauses. Existing theorem provers may be used to evaluate literals and clauses in the models thus represented (using the standard proof by consistency mechanism). We also prove that for some classes of clauses, the extracted model can also be represented by a tree automaton on tuples of finite trees. This entails in particular that the evaluation of arbitrary function-free formulae in the represented models is decidable.