4513 search results - page 146 / 903 » Logic programming with satisfiability |
174
click to vote
ICLP
2007
Springer
16 years 10 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...
165
click to vote
LOPSTR
2007
Springer
16 years 10 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...
180
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
JavaScript has become the most widely used language for clientside web programming. The dynamic nature of JavaScript makes understanding its code notoriously difficult, leading t...
147
click to vote
PEPM
2007
ACM
16 years 9 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 22 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...