Skip to main content
SpringerLink
Log in

Combining Instance Generation and Resolution

  • Conference paper
Frontiers of Combining Systems (FroCoS 2009)

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

Included in the following conference series:

Abstract

We present a new inference system for first-order logic, SIG-Res, which couples together SInst-Gen and ordered resolution into a single inference system. Given a set F of first order clauses we create two sets, P and R, each a subset of F. Under SIG-Res, P is saturated by SInst-Gen and resolution is applied to pairs of clauses in P ∪ R where at least one of the clauses is in R. We discuss the motivation for this inference system and prove its completeness. We also discuss our implementation called Spectrum and give some initial results.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bachmair, L., Ganzinger, H.: Resolution Theorem Proving. In: Robinson, J.A., Voronkovs, A. (eds.) Handbook of Automated Reasoning, ch. 2, vol. 1, pp. 19–99. Elsevier and MIT Press (2001)

    Google Scholar 

  2. Baumgartner, P.: Logical Engineering With Instance-Based Methods. In: Pfennings, F. (ed.) CAV 2007. LNCS, vol. 4590, pp. 298–302. Springer, Heidelberg (2007)

    Google Scholar 

  3. Baumgartner, P., Tinelli, C.: The Model Evolution Calculus as a First-Order DPLL Method. Artificial Intelligence 172, 591–632 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Communications of the ACM 5(7), 394–397 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  5. Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the ACM 7(3), 201–215 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  6. de Moura, L., Bjørner, N.S.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Deshane, T., Hu, W., Jablonski, P., Lin, H., Lynch, C., McGregor, R.E.: Encoding First Order Proofs in SAT. In: Pfenning, F. (ed.) CADE 2007. LNCS, vol. 4603, pp. 476–491. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. B. Dutertre, L. de Moura. The Yices SMT Solver, http://yices.csl.sri.com/tool-paper.pdf

  9. Ganzinger, H., Korovin, K.: New Directions in Instantiation-Based Theorem Proving. In: Proc. 18th IEEE Symposium on Logic in Computer Science (LICS 2003), pp. 55–64. IEEE Computer Society Press, Los Alamitos (2003)

    Chapter  Google Scholar 

  10. Hooker, J.N., Rago, G., Chandru, V., Shrivastava, A.: Partial Instantiation Methods for Inference in First Order Logic. Journal of Automated Reasoning 28(4), 371–396 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Jackson, D.: Automating First-Order Relational Logic. ACM SIGSOFT Software Engineering Notes 25(6), 130–139 (2000)

    Article  MathSciNet  Google Scholar 

  12. Jeroslow, R.G.: Computation-Oriented Reductions of Predicate to Propositional Logic. In: Decision Support Systems, vol. 4, pp. 183–197. Elsevier Science, Amsterdam (1988)

    Google Scholar 

  13. Jeroslow, R.G.: Logic-Based Decision Support: Mixed Integer Model Formulation. In: Annals of Discrete Mathematics, vol. 40. North-Holland, Amsterdam (1989)

    Google Scholar 

  14. Korovin, K.: An Invitation to Instantiation-Based Reasoning: From Theory to Practice. Volume in Memoriam of Harald Ganzinger. LNCS (to appear)

    Google Scholar 

  15. Korovin, K.: System Description: iProver - An Instantiation-Based Theorem Prover for First-Order Logic. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 292–298. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Leitsch, A.: The Resolution Calculus. Springer, Heidelberg (1997)

    Book  MATH  Google Scholar 

  17. Lynch, C., Tran, D.: SMELS: Satisfiability Modulo Equality with Lazy Superposition. In: Cha, S(S.), Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol. 5311, pp. 186–200. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Loveland, D.W.: Automated Theorem Proving: a Logical Basis. Fundamental Studies in Computer Science. Elsevier/North-Holland (1978)

    Google Scholar 

  19. Paola Bonacina, M., Lynch, C., de Moura, L.: On Deciding Satisfiability by DPLL(Gamma+T) and Unsound Theorem Proving. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 35–50. Springer, Heidelberg (2009)

    Google Scholar 

  20. Robinson, J.A.: A Machine-Oriented Logic Based on the Resolution Principle. J. Association for Computing Machinery 12, 23–41 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  21. Slagle, J.R.: Automatic Theorem Proving with Renamable and Semantic Resolution. Journal of the ACM 14(4), 687–697 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  22. Strichman, O., Seshia, S.A., Bryant, R.E.: Deciding Separation Formulas With SAT. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 113–124. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  23. Sutcliffe, G.: The SZS Ontology, http://www.cs.miami.edu/~tptp

  24. Sutcliffe, G.: The CADE-21 Automated Theorem Proving System Competition. AI Communications 21(1), 71–82

    Google Scholar 

  25. Sutcliffe, G., Suttner, C.B.: The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning 21(2), 177–203 (1998)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Clarkson University, USA

    Christopher Lynch & Ralph Eric McGregor

Authors
  1. Christopher Lynch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralph Eric McGregor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Università degli Studi di Milano, Via Comelico 39, 20135, Milano, Italy

    Silvio Ghilardi

  2. Dipartemento di Ingegneria e Scienza dell’Informazione, Università di Trento, Facoltà di Scienze, Via Sommarive 14, 38050, Povo, Trento, Italy

    Roberto Sebastiani

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lynch, C., McGregor, R.E. (2009). Combining Instance Generation and Resolution. In: Ghilardi, S., Sebastiani, R. (eds) Frontiers of Combining Systems. FroCoS 2009. Lecture Notes in Computer Science(), vol 5749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04222-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04222-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04221-8

  • Online ISBN: 978-3-642-04222-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation