Sciweavers

3090 search results - page 45 / 618
» On Testing Answer-Set Programs
Sort
View
ICLP
2004
Springer
14 years 3 months ago
On Programs with Linearly Ordered Multiple Preferences
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...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
LPNMR
2011
Springer
13 years 23 days ago
Communicating ASP and the Polynomial Hierarchy
Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expre...
Kim Bauters, Steven Schockaert, Dirk Vermeir, Mart...
AAAI
2010
13 years 11 months ago
Ordered Completion for First-Order Logic Programs on Finite Structures
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...
Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou
LPNMR
2005
Springer
14 years 3 months ago
SELP - A System for Studying Strong Equivalence Between Logic Programs
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...
Yin Chen, Fangzhen Lin, Lei Li
JELIA
2010
Springer
13 years 8 months ago
Coala: A Compiler from Action Languages to ASP
Action languages allow for compactly describing dynamic domains. They are usually implemented by compilation, e.g., to Answer Set Programming. To this end, we developed a tool, cal...
Martin Gebser, Torsten Grote, Torsten Schaub