Sciweavers

86 search results - page 4 / 18
» Translating Preferred Answer Set Programs to Propositional L...
Sort
View
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...
ICLP
2005
Springer
14 years 1 months ago
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
Hans Tompits, Stefan Woltran
APAL
2005
135views more  APAL 2005»
13 years 7 months ago
Safe beliefs for propositional theories
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
Mauricio Osorio, Juan Antonio Navarro Pérez...
KR
2004
Springer
14 years 1 months ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka
LPNMR
2007
Springer
14 years 1 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
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...