3470 search results - page 66 / 694 » Head-Elementary-Set-Free Logic Programs |
178
click to vote
ICLP
1994
Springer
15 years 8 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...
159
click to vote
LPAR
1994
Springer
15 years 8 months ago
1994
Springer
In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. The soundness and the completeness of the diagnoser are proved. The...
140
click to vote
AMAI
2005
Springer
15 years 4 months ago
2005
Springer
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about t...
126
click to vote
ICLP
1992
Springer
15 years 8 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
154
click to vote
DALT
2004
Springer
15 years 8 months ago
2004
Springer
Systems of autonomous agents providing automated services over the Web are fast becoming a reality. Often these agent systems are constructed using procedural architectures that pr...