2519 search results - page 274 / 504 » Reasoning with Textual Cases |
167
click to vote
LICS
1996
IEEE
15 years 10 months ago
1996
IEEE
Real PCF is an extension of the programming language PCF with a data type for real numbers. Although a Real PCF definable real number cannot be computed in finitely many steps, it...
217
click to vote
ICLP
1994
Springer
15 years 10 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
153
click to vote
ECAI
1992
Springer
15 years 10 months ago
1992
Springer
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
228
click to vote
KR
1994
Springer
15 years 10 months ago
1994
Springer
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
167
click to vote
LOPSTR
1994
Springer
15 years 10 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...