Skip to main content
SpringerLink
Log in

Finite model search for equational theories (FMSET)

  • Conference paper
  • First Online:
Artificial Intelligence and Symbolic Computation (AISC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1476))

  • 104 Accesses

Abstract

Finite model and counter model generation is a potential alternative in automated theorem proving. In this paper, we introduce a system called FMSET which generates finite structures representing models of equational theories. FMSET performs a satisfiability test over a set of special first order clauses called ≓simple clauses≓. Several experiments over a variety of problems have been pursued. FMSET uses symmetries to prune the search space from isomorphic branches with very competitive performances in the domain.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Slaney M. Fujita and F. Bennett. Automatic generation of some results in finite algebra. In proceedings of the 13th Internationnal Joint Conference on Artificial Intelligence, Chambery, France, pages 52–57, 1993.

    Google Scholar 

  2. W. McCune. A Davis Putnam program and its application to finite fist order model search: quasi-group existence problems. Technical Report ANL/MCS-TM-1994, Argonne National Laboratory, 1994.

    Google Scholar 

  3. J. Slaney. Finder: Finite domain enumerator, version 3.0 notes and guide. Technical report, Austrian National University, 1993.

    Google Scholar 

  4. H. Zhang and M. Stickel. Implementing the Davis and Putnam algorithm by tries. Technical report, University of IOWA, 1994.

    Google Scholar 

  5. J. Zhang. Problems on the generation of finite models. in proceedings of CADE-12, Nancy, France, pages 753–757, 1994.

    Google Scholar 

  6. J. Zhang. Constructing finite algebras with FALCON. Journal of automated reasoning, 17, pages 1–22, 1996.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique de Marseille, Centre de Mathématiques et d’Informatique, 39, rue Joliot Curie, 13453, Marseille cedex 13, France

    Belaid Benhamou & Laurent Henocque

Authors
  1. Belaid Benhamou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent Henocque
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Calmet Jan Plaza

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benhamou, B., Henocque, L. (1998). Finite model search for equational theories (FMSET). In: Calmet, J., Plaza, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 1998. Lecture Notes in Computer Science, vol 1476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055904

Download citation

  • DOI: https://doi.org/10.1007/BFb0055904

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64960-1

  • Online ISBN: 978-3-540-49816-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation