An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic.
Marco BozzanoRoberto BruttomessoAlessandro CimattiTommi A. JunttilaPeter van RossumStephan SchulzRoberto SebastianiPublished in: TACAS (2005)
Keyphrases
- logic programming
- davis putnam
- satisfiability problem
- propositional logic
- computational properties
- classical logic
- micron cmos
- shift register
- integer arithmetic
- proof procedure
- multi valued
- automated reasoning
- linear systems
- linear model
- search procedure
- np complete
- logic programs
- sat problem
- predicate calculus
- floating point
- incremental version
- bounded model checking
- tableau calculus