580 search results - page 44 / 116 » On the Foundations of Answer Set Programming |
141
Voted
FOIKS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Pro...
257
Voted
POPL
2004
ACM
16 years 4 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
171
Voted
ICLP
1994
Springer
15 years 7 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
116
Voted
LPNMR
2004
Springer
15 years 9 months ago
2004
Springer
nlp is a compiler for nested logic programming under answer set semantics. It is designed as a front-end translating nested logic programs into disjunctive ones, whose answer sets ...
143
Voted
IJCAI
2007
15 years 5 months ago
2007
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...