52 search results - page 3 / 11 » Encoding Quantified CSPs as Quantified Boolean Formulae |
67
Voted
IJCAI
2007
15 years 2 months ago
2007
77
Voted
ECCC
2008
15 years 1 months ago
2008
115
Voted
ICAI
2009
14 years 11 months ago
2009
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused...
133
Voted
AI
2008
Springer
15 years 1 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
101
Voted
APAL
2004
15 years 1 months ago
2004
Gaifman's normal form theorem showed that every first order sentence of quantifier rank n is equivalent to a Boolean combination of "scattered local sentences", whe...