2214 search results - page 197 / 443 » Complexity of Reasoning |
127
click to vote
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
162
Voted
LPNMR
1997
Springer
15 years 7 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
126
Voted
TIME
1994
IEEE
15 years 7 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
126
click to vote
ICLP
1993
Springer
15 years 7 months ago
1993
Springer
nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
130
click to vote
LOPSTR
1994
Springer
15 years 7 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...