6 search results - page 1 / 2 » Weak Integer Quantifier Elimination Beyond the Linear Case |
82
Voted
CASC
2007
Springer
15 years 4 months ago
2007
Springer
122
click to vote
CASC
2006
Springer
15 years 4 months ago
2006
Springer
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
134
Voted
CSL
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
120
click to vote
CADE
2005
Springer
16 years 26 days 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...
115
Voted
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...