Increasing model building capabilities by constraint solving on terms with integer exponents

Journal of Symbolic Computation

Volumn 24, Issue 1, 1997, Pages 59-101

  Peltier, Nicolas ^a  

^a INPG IMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031190743     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1997.0114     Document Type: Article

References (30)

1. Bourely, C., Caferra, R., Peltier, N. (1994). A method for building models automatically. Experiments with an extension of OTTER. In Proceedings of CADE-12, pp. 72-86. Springer-Verlag. LNAI 814.
2. Chen, H., Hsiang, J. (1991). Logic programming with recurrence domains. In Automata, Languages and Programming (ICALP'91), pp. 20-34. Springer-Verlag, LNCS 510.
3. Chen, H., Hsiang, J., Kong, H.-C. (1990). On finite representations of infinite sequences of terms. In Conditional and Typed Rewriting Systems, 2nd International Workshop, pp. 100-114. Springer-Verlag, LNCS 516.
4. Comon, H., Lescanne, P. (1989). Equational problems and disunification. J. Symbolic Comput. 7, 371-475.
5. Comon, H. (1988). Unification et Disunification. Théorie et Applications. PhD thesis, INPG, Grenoble.
6. Comon, H. (1995). On unification of terms with integer exponents. Math. Systems Theory 28, 67-68.
7. Comon, H., Treinen, R. (1992) The first order theory of lexicographic path orderings is undecidable. Theoret. Comput. Sci. 176. To appear.
8. Cooper, D.C. (1972). Theorem proving in arithmetic without multiplication. In Bernard Meltzer and Donald Michie, (eds), Machine Intelligence 7, chapter 5, pp. 91-99. Edinburgh University Press.
9. Caferra, R., Peltier, N. (1995). Model building and interactive theory discovery In Proceedings of the 4th Workshop on Tableaux and Related Methods 95, pp. 154-168. Springer-Verlag, LNAI 918.
10. Caferra, R., Zabel, N. (1990). Extending resolution for model construction. In Proceedings of Logics in AI, JELIA'90, pp. 153-169. Springer-Verlag, LNAI 478.
11. Caferra, R., Zabel, N. (1992). A method for simultaneous search for refutations and models by equational constraint solving. J. Symbolic Comput. 13, 613-641.
12. Dreben, B., Goldfarb, W.D. (1979). The Decision Problem, Solvable Classes of Quantificational Formulas. Addison-Wesley.
13. Dörre, J., Rounds, W.C. (1992). On subsumption and semiunification in feature algebras. J. Symbolic Comput. 13, 441-461.
14. Fermüller, C.G., Leitsch, A. (1992). Model building by resolution. In Computer Science Logic, CSL92, pp. 134-148. Lecture Notes in Computer Science vol. 702, Springer-Verlag.
15. Gelernter, H., Hansen, J.R., Loveland, D.W. (1983). Empirical explorations of the geometry theorem-proving machine. In Jörg Siekmann and Graham Wrightson, (eds), Automation of Reasoning, vol. 1, pp. 140-150. Springer-Verlag 1983. Originally published in 1960.
16. Hermann, M. (1994). 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.
17. Hermann, M. (1992). On the relation between primitive recursion, schematization, and divergence. In Proceedings of the 3rd Conference on Algebraic and Logic Programming, pp. 115-127. Springer-Verlag, LNCS 632.
18. Jouannaud, J.P., Kirchner, C. (1991). Solving equations in abstracts algebra: a rule based survey of unification. In J.-L. Lassez and G. Plotkin, (eds), Essays in Honor of Alan Robinson, pp. 91-99. MIT Press.
19. Kunen, K. (1987). Answer sets and negation as failure. In Jean Louis lassez, (ed.), Proceedings of the Fourth International Conference on Logic Programming, pp. 219-227, MIT Press.
20. Maher, M.J. (1988). Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings of the Third Annual Symposium on Logic in Computer Science, pp. 248-357. IEEE Computer Society.
21. Malc'ev, A.I. (1971). Axiomatizable classes of locally free algebra of various type. In Benjamin Franklin Wells, (ed.), The Metamathematics of Algebraic Systems: Collected Papers 1936-1967, chapter 23, pp. 262-281, North Holland.
22. Presburger, M. (1929). Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Comptes Rendus du Ier Congrés de Mathématiciens des Pays Slaves, pp. 92-101.
23. Salzer, G. (1992). The unification of infinite sets of terms and its applications. In Logic Programming and Automated Reasonning (LPAR'92), pp. 409-429. Springer-Verlag, LNAI 624.
24. Salzer, G. (1993). On the relationship between cycle unification and the unification of infinite sets of terms. In W. Snyder, (ed.), UNIF'93, Boston (MA, USA).
25. Salzer, G. (1994). Primal grammar and unification modulo a binary clause. In Proceedings of CADE-12, pp. 72-86. Springer-Verlag, LNAI 814.
26. Slaney, J. (1992) Finder (finite domain enumerator): Notes and guides. Technical report, Australian National University Automated Reasoning Project, Canberra.
27. Tammet, T. (1991). Using resolution for deciding solvable classes and building finite models. In Baltic Computer Science, pp. 33-64. Springer-Verlag, LNCS 502.
28. Treinen, R. (1992). A new method for undecidability proofs of first order theories. J. Symbolic Comput. 14, 437-457.
29. Venkataraman, K.N. (1987). Decidability of the purely existential fragment of the theory of term algebra. J. ACM, 34, 492-510.
30. Zhang, J. (1993). Search for models of equational theories. In Proceedings of ICYCS-93, pp. 60-63.