247 search results - page 28 / 50 » Answer set programming with default logic |
113
click to vote
AMAI
2006
Springer
15 years 3 months ago
2006
Springer
The aim of this paper is to demonstrate that A-Prolog is a powerful language for the construction of reasoning systems. In fact, A-Prolog allows to specify the initial situation, t...
117
click to vote
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
120
click to vote
AAAI
2010
15 years 4 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
133
click to vote
LPAR
2004
Springer
15 years 8 months 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...
141
click to vote
ASP
2005
Springer
15 years 8 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...