149 search results - page 23 / 30 » Encoding Planning Problems in Nonmonotonic Logic Programs |
172
click to vote
ICLP
2011
Springer
14 years 6 months ago
2011
Springer
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
130
click to vote
PPDP
2010
Springer
15 years 26 days ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
119
click to vote
SIGMOD
2001
ACM
16 years 2 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
121
click to vote
ATMOS
2007
15 years 4 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
106
click to vote
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In spite of the significant evolution of spelling and grammar checkers for word-processing software, the problem of judging the appropriateness of language usage in diff...