1020 search results - page 69 / 204 » Tight Semantics for Logic Programs |
ECP
1997
Springer
14 years 1 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...
AAAI
2004
13 years 10 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 (...
AGP
1998
IEEE
14 years 1 months ago
1998
IEEE
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
PADL
2005
Springer
14 years 2 months ago
2005
Springer
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...
LPNMR
1995
Springer
14 years 12 days ago
1995
Springer
In this paper we propose a logic programming language which supports hypothetical updates together with integrity constraints. The language allows sequences of updates by sets of a...