207 search results - page 19 / 42 » Debugging Logic Programs under the Answer Set Semantics |
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
Within the last years, especially since the work proposed by Dung in 1995, argumentation has emerged as a central issue in Artificial Intelligence. With the so called argumentatio...
LPAR
2004
Springer
14 years 27 days ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
RULEML
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
JAIR
2007
13 years 7 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
AAAI
2008
13 years 9 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...