8232 search results - page 156 / 1647 » Dynamic Logic Programming |
172
Voted
ICLP
2007
Springer
16 years 9 days ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
164
click to vote
LOPSTR
2007
Springer
16 years 8 days ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
145
click to vote
PEPM
2007
ACM
16 years 8 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...
168
click to vote
LPNMR
2009
Springer
16 years 21 days 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...
165
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Similarity-based Logic Programming (briefly, SLP) has been proposed to enhance the LP paradigm with a kind of approximate reasoning which supports flexible information retrieval a...