Skip to main content
SpringerLink
Log in

Constructing infinite models represented by tree automata

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We propose a method to use finite model builders in order to construct infinite models of first-order formulae. The constructed models are Herbrand interpretations, in which the interpretation of the predicate symbols is specified by tree tuple automata (Comon et al. 1997). Our approach is based on formula transformation: a formula ϕ is transformed into a formula Δ(ϕ) s.t. ϕ has a model representable by a term tuple automaton iff Δ(ϕ) has a finite model. This paper is an extended version of Peltier (2008).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Audemard, G., Benhamou, B., Henocque, L.: Predicting and detecting symmetries in fol finite model search. J. Autom. Reason. 36(3), 177–212 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baumgartner, P.: FDPLL—a first-order Davis-Putnam-Logeman-Loveland procedure. In: McAllester, D. (ed.) CADE-17—The 17th International Conference on Automated Deduction. LNAI, vol. 1831, pp. 200–219. Springer, New York (2000)

    Chapter  Google Scholar 

  3. Caferra, R., Leitsch, A., Peltier, N.: Automated Model Building. Applied Logic Series, vol. 31. Kluwer, Dordrecht (2004)

    MATH  Google Scholar 

  4. Caferra, R., Zabel, N.: A method for simultaneous search for refutations and models by equational constraint solving. J. Symb. Comput. 13, 613–641 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Claessen, K., Sorensson, N.: New techniques that improve MACE-style finite model finding. In: Proceedings of the CADE-19 Workshop: Model Computation—Principles, Algorithms, Applications, Miami (2003)

  6. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. http://www.grappa.univ-lille3.fr/tata (1997)

  7. Fermueller, C., Pichler, R.: Model representation via contexts and implicit generalizations. In: CADE, pp. 409–423 (2005)

  8. Fitting, M.: First-Order Logic and Automated Theorem Proving. Texts and Monographs in Computer Science. Springer, New York (1990)

    MATH  Google Scholar 

  9. Gottlob, G., Pichler, R.: Working with ARMs: Complexity results on atomic representations of Herbrand models. Inf. Comput. 165, 183–207 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. McCune, B.: MACE 2.0 reference manual and guide. Technical report, Argonne National Laboratory (2001)

  11. Peltier, N.: A new method for automated finite model building exploiting failures and symmetries. J. Log. Comput. 8(4), 511–543 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Peltier, N.: Automated model building: From finite to infinite models. In: 9th International Conference on Artificial Intelligence and Symbolic Computation. LNCS, vol. 5144, pp. 155–169. Springer, New York (2008)

    Google Scholar 

  13. Plaisted, D., Greenbaum, S.: A structure-preserving clause form translation. J. Symbol. Comput. 2, 293–304 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  14. Slaney, J.: Finder: finite domain enumerator. In: Proc. of CADE-12. LNAI, vol. 814, pp. 798–801. Springer, New York (1994)

    Google Scholar 

  15. Zhang, J., Zhang, H.: System description: generating models by SEM. In: McRobbie, M.A., Slaney, J.K. (eds.) 13th International Conference on Automated Deduction. Lecture Notes in Computer Science, vol. 1104, pp. 308–312. Springer, New York (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, LIG, Bâtiment IMAG C - 220, rue de la Chimie, 38400, Saint Martin d’Hères, France

    Nicolas Peltier

Authors
  1. Nicolas Peltier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicolas Peltier.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peltier, N. Constructing infinite models represented by tree automata. Ann Math Artif Intell 56, 65–85 (2009). https://doi.org/10.1007/s10472-009-9143-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-009-9143-8

Keywords

Mathematics Subject Classifications (2000)

Search

Navigation