460 search results - page 16 / 92 » Revised Stable Models - A Semantics for Logic Programs |
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
AI
2011
Springer
13 years 2 months ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
AAAI
2004
13 years 9 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
ECP
1997
Springer
13 years 12 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...
SCCC
2005
IEEE
14 years 1 months ago
2005
IEEE
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...