论文信息 - Superposition Modulo Linear Arithmetic SUP(LA)

Superposition Modulo Linear Arithmetic SUP(LA)

The hierarchical superposition based theorem proving calculus of Bachmair, Ganzinger, and Waldmann enables the hierarchic combination of a theory with full first-order logic. If a clause set of the combination enjoys a sufficient completeness criterion, the calculus is even complete. We instantiate the calculus for the theory of linear arithmetic. In particular, we develop new effective versions for the standard superposition redundancy criteria taking the linear arithmetic theory into account. The resulting calculus is implemented in SPASS(LA) and extends the state of the art in proving properties of first-order formulas over linear arithmetic.

[1] Nikolaj Bjørner,et al. Engineering DPLL(T) + Saturation , 2008, IJCAR.

[2] Andreas Nonnengart,et al. Hybrid Systems Verification by Location Elimination , 2000, HSCC.

[3] U. Hustadt,et al. A Survey of Decidable First-Order Fragments and Description Logics , 2004 .

[4] Harald Ganzinger,et al. Refutational theorem proving for hierarchic first-order theories , 1994, Applicable Algebra in Engineering, Communication and Computing.

[5] Christoph Weidenbach,et al. Combining Superposition, Sorts and Splitting , 2001, Handbook of Automated Reasoning.

[6] Ernst Althaus,et al. Fast and Accurate Bounds on Linear Programs , 2009, SEA.

[7] Andrei Voronkov,et al. Integrating Linear Arithmetic into Superposition Calculus , 2007, CSL.

[8] Maria Paola Bonacina,et al. New results on rewrite-based satisfiability procedures , 2006, TOCL.

[9] Albert Oliveras,et al. SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers , 2008, SAT.

[10] Uwe Waldmann. Superposition and Chaining for Totally Ordered Divisible Abelian Groups , 2001, IJCAR.

[11] David K. Smith. Theory of Linear and Integer Programming , 1987 .