论文信息 - Optimizations in Decision Procedures for Propositional Linear Inequalities

Optimizations in Decision Procedures for Propositional Linear Inequalities

Abstract : Several decision procedures that were published in the last few years for sub-theories of propositional linear inequalities, i.e. a Boolean combination of predicates that belong to the theory, are based on a graph-based analysis of the formula's predicates. The analysis is always based on the predicates while ignoring the Boolean connectives between them. In this note we show how taking this information into account can significantly reduce the (practical) complexity of the decision procedure.

O. Strichman

[1] Amir Pnueli,et al. Deciding Equality Formulas by Small Domains Instantiations , 1999, CAV.

[2] Randal E. Bryant,et al. Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions , 1999, CAV.

[3] Randal E. Bryant,et al. Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic , 1999, TOCL.

[4] Randal E. Bryant,et al. Boolean satisfiability with transitivity constraints , 2000, TOCL.

[5] Ofer Strichman,et al. Deciding Separation Formulas with SAT , 2002, CAV.

[6] V. Pratt. Two Easy Theories Whose Combination is Hard , 2002 .

[7] Hai Zhou,et al. BDD Based Procedures for a Theory of Equality with Uninterpreted Functions , 2003, Formal Methods Syst. Des..