248 search results - page 8 / 50 » On the existence of stable models of non-stratified logic pr... |
WLP
2005
Springer
15 years 5 months ago
2005
Springer
Assigning semantics to logic programs via selector generated models (Schwarz 2002/2003) extends several semantics, like the stable, the inflationary, and the stable generated sema...
ASIAN
1999
Springer
15 years 3 months ago
1999
Springer
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
192
click to vote
PADL
2009
Springer
16 years 8 days ago
2009
Springer
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...
105
click to vote
ECP
1997
Springer
15 years 3 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...