Sciweavers

1781 search results - page 3 / 357
» Functional Answer Set Programming
Sort
View
AAAI
2010
13 years 7 months ago
First-Order Indefinability of Answer Set Programs on Finite Structures
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this p...
Yin Chen, Yan Zhang, Yi Zhou
LPNMR
2005
Springer
14 years 1 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
FOIKS
2008
Springer
13 years 9 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
LPNMR
2009
Springer
14 years 2 months ago
Translating Preferred Answer Set Programs to Propositional Logic
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Vernon Asuncion, Yan Zhang
ASP
2005
Springer
14 years 1 months ago
An Interactive Approach to Answer Set Programming
This paper outlines a novel approach to the computation of answer sets in an evolving and interactive environment. Instead of recomputing the semantics of the entire program, our a...
Martin Brain, Richard Watson, Marina De Vos