Subsumption Algorithms for Three-Valued Geometric Resolution
In an implementation of geometric resolution, the most costly operation is subsumption (or matching): One has to decide for a three-valued, geometric formula, whether this formula is false in a given interpretation. The formula contains only atoms with variables, equality, and existential quantifiers. The interpretation contains only atoms with constants.
Because the atoms have no term structure, matching for geometric resolution is a hard problem. We translate the matching problem into a generalized constraint satisfaction problem, and give an algorithm that solves it efficiently. The algorithm uses learning techniques, similar to clause learning in propositional logic. Secondly, we adapt the algorithm in such a way that it finds solutions that use a minimal subset of the interpretation.
The techniques presented in this paper may have applications in constraint solving.
We gratefully acknowledge that this work was supported by the Polish National Science Center (Narodowe Centrum Nauki) under grant number DEC-2011/03/B/ST6/00346.
- 3.de Nivelle, H.: Theorem proving for classical logic with partial functions by reduction to Kleene logic. J. Logic Comput. (2014). (http://logcom.oxfordjournals.org/. April 2014)
- 4.de Nivelle, H.: Theorem proving for logic with partial functions by reduction to Kleene logic. In: Benzmüller, C., Otten, J. (eds.) VSL Workshop Proceedings of Automated Reasoning in Quantified Non-Classical Logics (ARQNL), pp. 71–85 (2014)Google Scholar
- 6.de Nivelle, H., Meng, J.: Theorem prover Geo 2007f, September 2006. http://www.ii.uni.wroc.pl/~nivelle/
- 10.Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Chap. 4, pp. 131–153. IOS Press (2009)Google Scholar
- 13.Sutcliffe, G.: The CADE ATP system competition, August 2015. http://www.cs.miami.edu/~tptp/CASC/25/