International Symposium on Frontiers of Combining Systems

Frontiers of Combining Systems pp 69-84 | Cite as

NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9322)

Abstract

We combine constrained literals for model representation with key concepts from first-order superposition and propositional conflict-driven clause learning (CDCL) to create the new calculus Non-Redundant Clause Learning (NRCL) deciding the Bernays-Schönfinkel fragment. We use first-order literals constrained by disequalities between tuples of terms for compact model representation. From superposition, NRCL inherits the abstract redundancy criterion and the monotone model operator. CDCL adds the dynamic, conflict-driven search for a model. As a result, NRCL finds a false clause modulo the current model candidate effectively. It guides the derivation of a first-order ordered resolvent that is never redundant. Similar to 1UIP-learning in CDCL, the learned resolvent induces backtracking and, by blocking the previous conflict state via propagation, it enforces progress towards finding a model or a refutation. The non-redundancy result also implies that only finitely many clauses can be generated by NRCL on the Bernays-Schönfinkel fragment, which proves termination.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alagi, G., Weidenbach, C.: NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment (Full Paper). CoRR, abs/1502.05501 (2015). http://arxiv.org/abs/1502.05501
  2. 2.
    Armando, A., Baumgartner, P., Dowek, G. (eds.): IJCAR 2008. LNCS (LNAI), vol. 5195. Springer, Heidelberg (2008)Google Scholar
  3. 3.
    Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson and Voronkov (eds.) [23], pp. 19–99Google Scholar
  4. 4.
    Baumgartner, P., Fuchs, A., Tinelli, C.: Lemma Learning in the model evolution calculus. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 572–586. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Baumgartner, P., Tinelli, C.: The model evolution calculus. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 350–364. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  6. 6.
    Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)Google Scholar
  7. 7.
    Bonacina, M.P., Plaisted, D.A.: SGGS theorem proving: an exposition. In: Notes of the Fourth Workshop on Practical Aspects in Automated Reasoning (PAAR) (2014)Google Scholar
  8. 8.
    Claessen, K., Srensson, N.: New Techniques that Improve MACE-style finite model finding. In: Model Computation - Principles, Algorithms, Applications (2003)Google Scholar
  9. 9.
    Comon, H.: Disunification: A survey. In: Computational Logic - Essays in Honor of Alan Robinson, pp. 322–359 (1991)Google Scholar
  10. 10.
    Fietzke, A., Weidenbach, C.: Labelled splitting. Ann. Math. Artif. Intell. 55(1–2), 3–34 (2009)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: LICS, pp. 55–64. IEEE Computer Society (2003)Google Scholar
  12. 12.
    Higman, G.: Ordering by Divisibility in Abstract Algebras. Proceedings of the London Mathematical Society 2(1), 326–336 (1952)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Hillenbrand, T., Weidenbach, C.: Superposition for bounded domains. In: Bonacina, M.P., Stickel, M.E. (eds.) Automated Reasoning and Mathematics. LNCS, vol. 7788, pp. 68–100. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  14. 14.
    Korovin, K.: iProver - An instantiation-based theorem prover for first-order logic (system description). In: Armando et al. [2], pp. 292–298Google Scholar
  15. 15.
    Korovin, K.: Inst-Gen – A modular approach to instantiation-based automated reasoning. In: Voronkov, A., Weidenbach, C. (eds.) Programming Logics. LNCS, vol. 7797, pp. 239–270. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  16. 16.
    Korovin, K.: Non-cyclic sorts for first-order satisfiability. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS, vol. 8152, pp. 214–228. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  17. 17.
    Lassez, J.-L., Marriott, K.: Explicit Representation of Terms Defined by Counter Examples. J. Autom. Reasoning 3(3), 301–317 (1987)CrossRefMATHGoogle Scholar
  18. 18.
    Lewis, H.R.: Complexity Results for Classes of Quantificational Formulas. J. Comput. Syst. Sci. 21(3), 317–353 (1980)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and abstract DPLL nodulo theories. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 36–50. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  20. 20.
    Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson and Voronkov [23], pp. 371–443Google Scholar
  21. 21.
    Pérez, J.A.N., Voronkov, A.: Proof Systems for Effectively Propositional Logic. In: Armando et al. [21], pp. 426–440Google Scholar
  22. 22.
    Piskac, R., de Moura, L.M., Bjørner, N.: Deciding Effectively Propositional Logic Using DPLL and Substitution Sets. J. Autom. Reasoning 44(4), 401–424 (2010)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Robinson, J.A., Voronkov, A. (eds.): Handbook of Automated Reasoning, vol. 2. Elsevier and MIT Press (2001)Google Scholar
  24. 24.
    Silva, J.P.M., Sakallah, K.A.: Conflict analysis in search algorithms for satisfiability. In: ICTAI, pp. 467–469 (1996)Google Scholar
  25. 25.
    Suda, M., Weidenbach, C., Wischnewski, P.: On the saturation of YAGO. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 441–456. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  26. 26.
    Tammet, T.: Finite model building: improvements and comparisons. In: Model Computation: Principles, Algorithms, Applications (2003)Google Scholar
  27. 27.
    Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson and Voronkov [23], pp. 1965–2013Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Saarbrücken Graduate School of Computer ScienceSaarbrückenGermany
  2. 2.Saarland UniversitySaarbrückenGermany
  3. 3.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations