52 search results - page 10 / 11 » Encoding Quantified CSPs as Quantified Boolean Formulae |
74
Voted
JSAT
2006
14 years 9 months ago
2006
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
166
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
100
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,...