21 search results - page 1 / 5 » Guarded Open Answer Set Programming with Generalized Literal... |
FOIKS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
LPNMR
2005
Springer
13 years 10 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
LPNMR
2005
Springer
13 years 10 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
JAPLL
2007
13 years 4 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...