%0 Generic %1 Brewka02b %A Brewka, Gerhard %A Niemelä, Ilkka %A Syrjanen, T. %D 2002 %K answer-set-programming, lpod, ordered-disjunction, smodels %T Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.5578 %X Logic programs with ordered disjunction (LPODs) add a new connective to logic programming. This connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: AB intuitively means: if possible A, but if A is not possible, then at least B. The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. In this paper we show how LPODs can be implemented using answer set solvers for normal programs. The...

@misc{Brewka02b, abstract = {{Logic programs with ordered disjunction (LPODs) add a new connective to logic programming. This connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: AB intuitively means: if possible A, but if A is not possible, then at least B. The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. In this paper we show how LPODs can be implemented using answer set solvers for normal programs. The...}}, added-at = {2011-05-04T16:04:17.000+0200}, author = {Brewka, Gerhard and Niemel\"{a}, Ilkka and Syrjanen, T.}, biburl = {https://www.bibsonomy.org/bibtex/2371c3f6dcbd26810767d489920b7b9bc/baisemain}, citeulike-article-id = {1783799}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.5578}, interhash = {92e4b74c5653ecc8c4a95698a7370388}, intrahash = {371c3f6dcbd26810767d489920b7b9bc}, keywords = {answer-set-programming, lpod, ordered-disjunction, smodels}, posted-at = {2007-10-18 10:41:35}, priority = {3}, timestamp = {2011-05-04T16:04:37.000+0200}, title = {{Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs}}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.5578}, year = 2002 }