Tree automata and automated model building

Fundamenta Informaticae

Volumn 30, Issue 1, 1997, Pages 59-81

  Peltier, Nicolas ^a  

^a Leibniz IMAG Laboratory   (France)

Author keywords

Automated Deduction; Model Building; Regular Tree Grammars; Tree Automata

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY; MATHEMATICAL MODELS; TREES (MATHEMATICS);

AUTOMATED DEDUCTION; REGULAR TREE GRAMMARS; TREE AUTOMATA;

COMPUTATIONAL GRAMMARS;

EID: 0031120731     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1997-30105     Document Type: Article

References (38)

1. B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Symposium on Theoretical Aspects of Computer Science, pages 436-449, 1992. LNCS 577.
2. C. Bourely, R. Caferra, and N. Peltier. A method for building models automatically. Experiments with an extension of OTTER. In Proc. of CADE-12, pages 72-86. Springer-Verlag, 1994. LNAI 814.
3. R. Caferra and N. Peltier. Extending semantic resolution via automated model building: applications. In Proceeding of IJCAI'95, pages 328-334. Morgan Kaufmann, 1995.
4. R. Caferra and N. Peltier. Model building and interactive theory discovery. In Proceeding of Tableaux'95, LNAI 918, pages 154-168. Springer-Verlag, 1995.
5. R. Caferra and N. Peltier. Decision procedures using model building techniques. In Proceeding of Computer Science Logic, CSL'95, pages 130-144. Springer-Verlag, LNCS 1092, 1996.
6. R. Caferra and N. Peltier. A significant extension of logic programming by adapting model buildings rules. In Proc. of Extensions of Logic Programming 96, pages 51-65. Springer-Verlag, LNAI1050, March 1996.
7. R. Caferra and N. Zabel. Extending resolution for model construction. In Logics in AI, JELIA '90, pages 153-169. Springer-Verlag, LNAI 478, 1990.
8. R. Caferra and N. Zabel. A method for simultaneous search for refutations and models by equational constraint solving. Journal of Symbolic Computation, 13:613-641, 1992.
9. H. Chen and J. Hsiang. Logic programming with recurrence domains. In Automata, Languages and Programming (ICALP'91), pages 20-34. Springer-Verlag, LNCS 510, 1991.
10. H. Chen, J. Hsiang, and H.-C. Kong. On finite representations of infinite sequences of terms. In Conditional and Typed Rewriting Systems, 2nd International Workshop, pages 100-114. Springer-Verlag, LNCS 516, June 1990.
11. H. Comon. Unification et Disunification. Théorie et Applications. PhD thesis, INPG, Grenoble, 1988.
12. H. Comon. Equational formulas in order-sorted algebra. In ICALP'90). Springer-Verlag, July 1990.
13. H. Comon. On unification of terms with integer exponents. Technical report, LRI, Orsay, France, 1992.
14. H. Comon and C. Delor. Equational formulae with membership constraints. Information and Computation, 112(2):167-216, August 1994.
15. H. Comon and P. Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371-475, 1989.
16. L. Console, D. T. Dupre, and P. Torasso. On the Relationship between Abduction and Deduction. Journal of Logic and Computation, 1(5):661-690, 1991.
17. C. Fermuller and A. Leitsch. Hyperresolution and automated model building. Journal of Logic and Computation, 6(2):173-203, 1996.
18. M. Fujita and R. Hasegawa. A model generation theorem prover in KL1 using a ramified stack algorithm. In Proceedings of 8th International Conference Symp. Logic Programming, pages 1070-1080, 1991.
19. J. H. Gallier. Logic for Computer Science. Harper & Row, 1986.
20. F. Gécseg and M. Steinby. Tree automata. Akadémiai Kiadó, Budapest, Hungary, 1984.
21. G. Gottlob and A. Leitsch. On the efficiency of subsumption algorithms. Journal of the ACM, 32(2):280-295, April 1985.
22. M. Hermann. On the relation between primitive recursion, schematization, and divergence. In Proceeding 3rd Conference on Algebraic and Logic Programming, pages 115-127. Springer-Verlag, LNCS 632, 1992.
23. M. Hermann. Divergence des systèmes de réécriture et schématisation des ensembles infinis de termes. Habilitation, Université de Nancy I, and CRIN-CNRS Inria-Lorraine, Nancy, France, March 1994.
24. K. Inoue, Y. Ohta, R. Hasegawa, and M. Nakashima. Bottom-up abduction by model generation. In Froc. IJCAI-93, volume 1, pages 102-108, Morgan Kaufmann, 1993.
25. D. W. Loveland. Automated Theorem Proving: A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North Holland, 1978.
26. R. Manthey and F. Bry. Satchmo: A theorem prover implemented in Prolog. In Proc. of CADE-9, pages 415-434. Springer-Verlag, LNCS 310, 1988.
27. R. Matzinger. Computational representations of Herbrand models using grammars. In Computer Science Logic, CSL'96, 1997.
28. N. Peltier. Increasing the capabilities of model building by constraint solving with terms with integer exponents. To appear in the Journal of Symbolic Computation (also available as research report IMAG 966-I), 1996.
29. G. Salzer. The unification of infinite sets of terms and its applications. In Logic Programming and Automated Reasoning (LPAR'92), pages 409-429. Springer-Verlag, LNAI 624, July 1992.
30. G. Salzer. On the relationship between cycle unification and the unification of infinite sets of terms. In UNIF'93, 1993.
31. J. R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the ACM, 14(4):687-697, October 1967.
32. J. Slaney. Finder (finite domain enumerator): Notes and guides. Technical report, Australian National University Automated Reasoning Project, Canberra, 1992.
33. C. B. Suttner and G. Sutcliffe. The TPTP problem library. Technical report, TU München / James Cook University, 1995. V-1.2.0.
34. T. Tammet. Using resolution for deciding solvable classes and building finite models. In Baltic Computer Science, pages 33-64. Springer-Verlag, LNCS 502, 1991.
35. C. Weidenbach. Extending the Resolution Method with Sorts In Proceeding of IJCAI'93, p 60-65, Morgan Kaufmann. Chambéry, France. August 93.
36. S. Winker. Generation and verification of finite models and counter-examples using an automated theorem prover answering two open questions. Journal of the ACM, 29(2):273-284, April 1982.
37. L. Wos, R. Overbeek, E. Lusk, and J. Boyle. Automated Reasoning: Introduction and Applications. McGraw-Hill, second edition, 1992.
38. J. Zhang. Search for models of equational theories. In Proceedings of ICYCS-93, pages 60-63, 1993.