Abstract
Finding computationally valuable representations of models of predicate logic formulas is an important issue in the field of automated theorem proving, e.g. for automated model building or semantic resolution. In this article we treat the problem of representing single models independently of building them and discuss the power of different mechanisms for this purpose. We start with investigating context-free languages for representing single Herbrand models. We show their computational feasibility and prove their expressive power to be exactly the finite models. We show an equivalence with “ground atoms and ground equations” concluding equal expressive power. Finally we indicate how various other well known techniques could be used for representing essentially infinite models (i.e. models of not finitely controllable formulas), thus motivating our interest in relating model properties with syntactical properties of corresponding Herbrand models and in investigating connections between formal language theory, term schematizations and automated model building.
This work was partially supported by the Austrian Science Foundation under FWF grant P11624-MAT.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. Bourely, R. Caferra, and N. Peltier. A method for building models automatically. Experiments with an extension of otter. In Alan Bundy, editor, 12th International Conference on Automated Deduction, pages 72–86, Nancy/France, June 1994. Springer Verlag, LNAI 814.
B. Bogaert and Sophie Tison. Equality and disequality constraints on direct subterms in tree automata. In A. Finkel, editor, Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science, volume 577 of LNCS, pages 161–172, Cachan, 1992. Springer.
Anne-Cécile Caron, Jean-Luc Coquidé, and Max Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proc. 5th RTA, volume 690 of LNCS, pages 328–342. Springer, June 1993.
H. Chen, J. Hsiang, and H.-C. Kong. On finite representations of infinite sequences of terms. In S. Kaplan and M. Okada, editors, Proceedings 2nd International Workshop on Conditional and Typed Rewriting Systems, volume 516 of LNCS, pages 100–114, Montreal, Canada, June 1990. Springer.
C.-L. Chang and R. C. T. Lee. Symbolic Logic an Mechanical Theorem Proving. Academic Press, New York, 1973.
H. Comon and P. Lescanne. Equational Problems and Disunification. Journal of Symbolic Computation, 7(34):371–426, March/April 1989.
H. Comon. On unification of terms with integer exponents. Mathematical Systems Theory, 28(1):67–88, 1995.
R. Caferra and N. Peltier. Decision procedures using model building techniques. In Computer Science Logic (9th Int. Workshop CSL'95), pages 131–144, Paderborn, Germany, 1995. Springer Verlag. LNCS 1092.
R. Caferra and N. Zabel. A method for simultanous search for refutations and models by equational constraint solving. Journal of Symbolic Computation, 13(6):613–641, June 1992.
C. Fermüller and A. Leitsch. Model building by resolution. In Computer Science Logic (CSL'92), pages 134–148, San Miniato, Italy, 1993. Springer Verlag. LNCS 702.
C. Fermüller and A. Leitsch. Decision procedures and model building in equational clause logic. Technical Report TR-CS-FL-96-1, TU Wien, Vienna/Austria, 1996.
C. Fermüller and A. Leitsch. Hyperresolution and automated model building. J. of Logic and Computation, 6(2):173–203, 1996.
R. Galbavy and M. Hermann. Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science, 176, April 1997.
F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, Oxford, 1970.
D. Loveland. Automated Theorem Proving — A Logical Basis. North Holland, 1978.
R. Matzinger. Computational representations of Herbrand models using grammars. In D.v. Dalen, editor, Proceedings of the CSL'96, LNCS. Springer, 1997. To appear.
R. Matzinger. Context free term sets are regular-and some applications to logic. Technical Report TR-WB-Mat-97-2, TU Wien, Vienna/Austria, 1997.
G. Nelson and D.C. Oppen. Fast decision algorithms based on congruence closure. JACM, 23(2):356–364, 1980.
G. Rozenberg and A. Salomaa, editors. Lindenmayer Systems. Springer, 1992.
A. Salomaa. Formal languages. Academic Press, Orlando, 1973.
G. Salzer. The unification of infinite sets of terms and its applications. In A. Voronkov, editor, Proceedings Logic Programming and Automated Reasoning, St. Petersburg (Russia), volume 624 of Lecture Notes in Computer Science (in Art. Intelligence). Springer, 1992.
J. Slaney. FINDER (finite domain enumerator): Notes and guide. Technical Report TR-ARP-1/92, Australien National University Automated Reasoning Project, Canberra, 1992.
J. Slaney. SCOTT: A model-guided theorem prover. In Proceedings of the 13th international joint conference on artificial intelligence (IJCAI `93), volume 1, pages 109–114. Morgan Kaufmann Publishers, 1993.
T. Tammet. Using resolution for deciding solvable classes and building finite models. In Baltic Computer Science, pages 33–64. Springer Verlag, 1991. LNCS 502.
C. Weidenbach. Unification in pseudo-linear sort theories is decidable. In M.A. McRobbie and J.K. Slaney, editors, Automated Deduction — Cade-13, LNAI 1104, pages 343–357, New Brunswick, NJ, USA, July 1996. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matzinger, R. (1997). Comparing computational representations of Herbrand models. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1997. Lecture Notes in Computer Science, vol 1289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63385-5_44
Download citation
DOI: https://doi.org/10.1007/3-540-63385-5_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63385-3
Online ISBN: 978-3-540-69806-7
eBook Packages: Springer Book Archive