4573 search results - page 723 / 915 » Automated Reasoning |
224
Voted
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate co...
136
Voted
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
143
Voted
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
142
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
115
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...