284 search results - page 8 / 57 » Answer Set Programming for the Semantic Web |
107
Voted
ASP
2003
Springer
15 years 2 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
AMAI
2008
Springer
14 years 9 months ago
2008
Springer
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...
FOIKS
2006
Springer
15 years 1 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...
101
click to vote
JAIR
2012
12 years 12 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
LPNMR
2005
Springer
15 years 2 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 ...