MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  IOS Press Tree Automata and Automated Model Building

Download:
pdf | ps
by Nicolas Peltier
http://www-leibniz.imag.fr/ATINF/PUBLICATIONS/nico-fi.ps.gz
Add To MetaCart

Abstract:

Abstract. The use of regular tree grammars to represent and build models of formulae of first-order logic without equality is investigated. The combination of regular tree grammars with equational constraints provides a powerful and general way of representing Herbrand models. We show that the evaluation problem (i.e. the problem of finding the truth value of a formula in a given model) is decidable when models are represented in the way we propose. We also define a method to build such representations of models for first-order formulae. These results are a powerful extension of our former method for simultaneous search for refutations and models.

Citations

149 On the Relationship Between Abduction and Deduction – Console, Dupré, et al. - 1991
126 SATCHMO: A Theorem Prover Implemented in Prolog – Manthey, Bry - 1988
100 The TPTP problem library – Sutcliffe, Suttner, et al. - 1994
92 Equational problems and disunification – Comon, Lescanne - 1989
59 Automated Reasoning: Introduction and Applications – Wos, Overbeek, et al. - 1984
50 Hyperresolution and automated model building – Fermüller, Leitsch - 1996
45 A Method for Simultaneous Search for Refutations and Models by Equational Constraint Solving – Caferra, Zabel - 1992
35 A model generation theorem prover in KL1 using a ramified-stack algorithm – Fujita, Hasegawa - 1991
31 A method for building models automatically. Experiments with an extension of Otter – Bourely, Caferra, et al. - 1994
30 Equality and disequality constraints on direct subterms in tree automata – Bogaert, Tison - 1992
30 Automatic theorem proving with renamable and semantic resolution – Slagle - 1967
30 FINDER (Finite Domain Enumerator): Notes and Guide – Slaney - 1992
30 Using resolution for deciding solvable classes and building finite models – Tammet - 1991
27 Equational formulae with membership constraints – Comon, Delor - 1994
22 Extending Resolution for Model Construction – Caferra, Zabel - 1991
22 On unification of terms with integer exponents – Comon - 1995
22 On the Efficiency of Subsumption Algorithms – Gottlob, Leitsch - 1985
19 Decision Procedures using Model Building techniques – Caferra, Peltier - 1995
19 The unification of infinite sets of terms and its applications – Salzer - 1992
19 Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions – Winker - 1982
18 Logic programming with recurrence domains – Chen, Hsiang - 1991
18 Equational formulas in order-sorted algebras – Comon - 1990
17 Automated Theorem Proving: A Logical Basis, volume 6 – Loveland - 1978
16 Extending semantic resolution via automated model building: applications – Caferra, Peltier - 1995
16 On finite representations of infinite sequences of terms – Chen, Hsiang, et al. - 1990
13 Model building and interactive theory discovery – CAFERRA, PELTIER - 1995
13 Bottom-up Abduction by Model generation – Inoue, Ohta, et al. - 1993
12 Unification et Disunification. Th'eorie et Applications – Comon - 1988
12 Increasing the capabilities of model building by constraint solving with terms with integer exponents – Peltier - 1996
8 Computational representations of Herbrand models using grammars – Matzinger - 1997
8 Extending the resolution method with sorts – Weidenbach - 1993
6 Tree Automata. Akad'emiai Kiad'o – ecseg, F, et al. - 1984
6 Divergence des syst`emes de r'e'ecriture et sch'ematisation des ensembles infinis de termes. Habilitation 94-T-065, Universit'e Henri Poincar'e Nancy 1 – Hermann - 1994
5 A significant extension of logic programming by adapting model buildings rules – Caferra, Peltier - 1996
4 On the relation between primitive recursion, schematization, and divergence – Hermann - 1992
4 Search for models of equational theories – Zhang - 1993
2 On the relationship between cycle unification and the unification of infinite sets of terms – SALZER - 1993