31 search results - page 3 / 7 » Complexity Results for Quantified Boolean Formulae Based on ... |
CSCLP
2008
Springer
13 years 9 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,...
DALT
2005
Springer
14 years 1 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
AUSAI
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
CAV
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...