30 search results - page 1 / 6 » Guarded Open Answer Set Programming |
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
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...
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...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web. We define guarded hybrid knowledge bases (or g-hybrid knowledge...