2152 search results - page 269 / 431 » On Automating the Calculus of Relations |
197
click to vote
LPNMR
1997
Springer
15 years 10 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...
161
click to vote
TIME
1994
IEEE
15 years 10 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 ...
154
click to vote
ICLP
1993
Springer
15 years 10 months ago
1993
Springer
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
210
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...
188
click to vote
LPNMR
1993
Springer
15 years 10 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...