3 search results - page 1 / 1 » Smallest Equivalent Sets for Finite Propositional Formula Ci... |
71
Voted
CL
2000
Springer
15 years 2 months ago
2000
Springer
ENTCS
2006
14 years 10 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
101
click to vote
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...