634 search results - page 7 / 127 » Completion Procedures as Semidecision Procedures |
VMCAI
2009
Springer
14 years 2 months ago
2009
Springer
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
CADE
2005
Springer
14 years 7 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...
RTA
2011
Springer
12 years 10 months ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
FROCOS
2009
Springer
13 years 11 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
IPL
2006
13 years 7 months ago
2006
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...