491 search results - page 8 / 99 » Linear Quantifier Elimination |
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...
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
FUIN
2010
13 years 4 months ago
2010
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
LICS
1995
IEEE
13 years 11 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
COMSWARE
2008
IEEE
14 years 1 months ago
2008
IEEE
—Presence technology is going to be an integral part of the next generation of communication technology. It can eliminate telephone tag between two parties (caller and callee), w...