9 search results - page 2 / 2 » AI at 50: From Programs to Solvers - Models and Techniques f... |
CP
2005
Springer
13 years 11 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
ECP
1997
Springer
13 years 9 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
AI
2011
Springer
13 years 11 days ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
WWW
2005
ACM
14 years 6 months ago
2005
ACM
The demand for quickly delivering new applications is increasingly becoming a business imperative today. Application development is often done in an ad hoc manner, without standar...