Skip to main content
SpringerLink
Log in

Automated Inference of Finite Unsatisfiability

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We present Infinox, an automated tool for analyzing first-order logic problems, aimed at showing finite unsatisfiability, i.e., the absence of models with finite domains. Finite satisfiability is not a decidable problem (only semi-decidable), which means that such a tool can never be complete. Nonetheless, our hope is that Infinox be a useful complement to finite model finders in practice. Infinox uses several different proof techniques for showing infinity of a set, each of which requires the identification of a function or a relation with particular properties. Infinox enumerates candidates to such functions and relations, and subsequently uses an automated theorem prover as a sub-procedure to try to prove the resulting proof obligations. We have evaluated Infinox on the relevant problems from the TPTP benchmark suite, and we are able to automatically show finite unsatisfiability for over 25% of these problems.

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. Benzmüller, C., Theiss, F., Paulson, L., Fietzke, A.: LEO-II—a cooperative automatic theorem prover for higher-order logic. In: Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, 12–15 August, 2008, Proceedings. LNCS, vol. 5195, pp. 162–170. Springer (2008)

  2. Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Universitext. Springer (2001)

  3. Claessen, K., Lillieström, A.: Automated inference of finite unsatisfiability. In: CADE-22: Proceedings of the 22nd International Conference on Automated Deduction, pp. 388–403. Springer, Berlin, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Claessen, K., Sörensson, N.: New techniques that improve MACE-style model finding. In: Proc. of Workshop on Model Computation (MODEL) (2003)

  5. Curry, H.B.: Foundations of Mathematical Logic. Courier Dover Publications (1977)

  6. McCune, W.: Solution of the Robbins problem. J. Autom. Reas. 19(3), 263–276 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. McCune, W.: Mace4 reference manual and guide. CoRR, cs.SC/0310055 (2003)

  8. Roederer, A., Puzis, Y., Sutcliffe, G.: Divvy: an ATP meta-system based on axiom relevance ordering. In: CADE, pp. 157–162 (2009)

  9. Schulz, S.: E—a brainiac theorem prover. AI Commun. 15(2, 3), 111–126 (2002)

    MATH  Google Scholar 

  10. Sutcliffe, G.: The SZS ontologies for automated reasoning software. In: Rudnicki, P., Sutcliffe, G., Konev, B., Schmidt, R.A., Schulz, S. (eds.) LPAR Workshops. CEUR Workshop Proceedings, vol. 418. CEUR-WS.org (2008)

  11. Sutcliffe, G.: The TPTP problem library and associated infrastructure: the FOF and CNF parts, v3.5.0. J. Autom. Reas. 43(4), 337–362 (2009)

    Article  MATH  Google Scholar 

  12. Sutcliffe, G., Suttner, C.: The state of CASC. AI Commun. 19(1), 35–48 (2006)

    MATH  MathSciNet  Google Scholar 

  13. Vännännen, J.: A Short Course on Finite Model Theory. Department of Mathematics, University of Helsinki (2006)

  14. Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobalt, C., Topić, D.: SPASS version 2.0. In: Voronkov, A. (ed.) Automated Deduction, CADE-18: 18th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence, vol. 2392, pp. 275–279. Springer, Copenhagen, Denmark (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chalmers University of Technology, Gothenburg, Sweden

    Koen Claessen & Ann Lillieström

Authors
  1. Koen Claessen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ann Lillieström
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ann Lillieström.

Additional information

This is an extended version of a paper with the same title published at CADE 2009 [3].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Claessen, K., Lillieström, A. Automated Inference of Finite Unsatisfiability. J Autom Reasoning 47, 111–132 (2011). https://doi.org/10.1007/s10817-010-9216-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-010-9216-8

Keywords

Search

Navigation