CADE
15 years 9 months ago
2005 Springer 
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
CADE
15 years 9 months ago
2005 Springer 
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
101
click to vote
CADE
15 years 9 months ago
2005 Springer 
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
101
click to vote
CADE
15 years 9 months ago
2005 Springer
We present a combination method for generating interpolants for a class of first-order theories. Using interpolant-generation procedures for individual theories as black-boxes, our...
114
click to vote
CADE
15 years 9 months ago
2005 Springer 
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
|
Logical Reasoning