3470 search results - page 258 / 694 » Head-Elementary-Set-Free Logic Programs |
154
click to vote
PEPM
2007
ACM
16 years 20 days ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
175
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
184
click to vote
ASP
2005
Springer
16 years 2 days ago
2005
Springer
This paper discusses the background, algorithms and implementation techniques to support programmers in ‘debugging’ logic programs under the answer set semantics. We first inv...
173
click to vote
LOPSTR
2004
Springer
15 years 12 months ago
2004
Springer
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
207
click to vote
SIGCSE
2000
ACM
15 years 11 months ago
2000
ACM
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classificatio...