3470 search results - page 79 / 694 » Head-Elementary-Set-Free Logic Programs |
116
click to vote
FLAIRS
1998
15 years 5 months ago
1998
In this papera newoperatorfor agent's implicit belief revisionis presented.Thisoperatoris conceptually based on the following requirement:anagent should find first anexplanat...
130
click to vote
EUROCOLT
1999
Springer
15 years 8 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
136
click to vote
ICLP
2007
Springer
15 years 8 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
218
click to vote
JUCS
2006
15 years 4 months ago
2006
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...
170
click to vote
OPODIS
2003
15 years 5 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...