Dejan Jovanović
Abstract
We propose a new decision procedure for the existential theory of the reals. It performs a backtracking search for a model in R, where the backtracking is powered by a novel conflict resolution procedure based on cylindrical algebraic decomposition. The initial experimental results are very encouraging. The full article has been accepted at the 6th International Joint Conference on Automated Reasoning (IJCAR 2012).
- C. W. Brown. Improved projection for cylindrical algebraic decomposition. Journal of Symbolic Computation, 32(5):447--465, 2001. Google Scholar
Digital Library
- G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Automata Theory and Formal Languages, pages 134--183. Springer, 1975. Google Scholar
- G. E. Collins and H. Hong. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12(3):299--328, 1991. Google ScholarDigital Library
- L. de Moura and N. Bjorner. Z3: An efficient SMT solver. TACAS 2008, pages 337--340, 2008. Google ScholarDigital Library
- H. Hong. An improvement of the projection operator in cylindrical algebraic decomposition. In Proceedings of the international symposium on Symbolic and algebraic computation, pages 261--264. ACM, 1990. Google ScholarDigital Library
- H. Hong. Comparison of several decision algorithms for the existential theory of the reals. 1991.Google Scholar
- J. P. M. Silva, I. Lynce, and S. Malik. Conflict-driven clause learning SAT solvers. In A. Biere, M. Heule, H. van Maaren, and T. Walsh, editors, Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, pages 131--153. IOS Press, 2009.Google Scholar
- A. Tarski. A decision method for elementary algebra and geometry. Technical Report R-109, Rand Corporation, 1951.Google Scholar
Index Terms
- Solving non-linear arithmetic
Recommendations
Constructive linear-time temporal logic: Proof systems and Kripke semantics
In this paper we study a version of constructive linear-time temporal logic (LTL) with the ''next'' temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time ...
A sequent calculus with dependent types for classical arithmetic
LICS '18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer ScienceIn a recent paper [11], Herbelin developed dPAω, a calculus in which constructive proofs for the axioms of countable and dependent choices could be derived via the encoding of a proof of countable universal quantification as a stream of it components. ...
Rewriting induction + linear arithmetic = decision procedure
IJCAR'12: Proceedings of the 6th international joint conference on Automated ReasoningThis paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear integer arithmetic is introduced and it is shown how these TRSs can be used in the ...
Comments