86 search results - page 10 / 18 » Translating Preferred Answer Set Programs to Propositional L... |
AAAI
2008
13 years 10 months ago
2008
One way to solve the knowledge acquisition bottleneck is to have ways to translate natural language sentences and discourses to a formal knowledge representation language, especia...
ICLP
2004
Springer
14 years 1 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
LPNMR
1999
Springer
13 years 12 months ago
1999
Springer
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
LPNMR
2005
Springer
14 years 1 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 ...
ENC
2005
IEEE
14 years 1 months ago
2005
IEEE
Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in...