35 search results - page 4 / 7 » Rewriting Induction Linear Arithmetic = Decision Procedure |
CADE
2004
Springer
14 years 8 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
CSCLP
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
CADE
2012
Springer
11 years 11 months ago
2012
Springer
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...