@inproceedings{kaer-etal-2008,
	Abstract = {Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last few years. Among them, the principle of ordered disjunction was developed to express totally ordered preferences for the alternatives in rule heads. In this paper we introduce an extension of this approach called Disjunctive Logic Programs with Ordered Disjunction (DLPOD) that combines ordered disjunction with common disjunction in rule heads. By this extension, we enhance the preference notions expressible with totally ordered disjunctions to partially ordered preferences. Furthermore, we show that computing optimal stable models for DLPODs still stays in $\Sigma_2^p$ for head-cycle free programs and establish $\Sigma_3^p$ upper bounds for the general case.},
	Author = {Philipp K{\"a}rger and Nuno Lopes and Daniel Olmedilla and Axel Polleres},
	Booktitle = {Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2008)},
	Month = dec,
	Title = {Towards Logic Programs with Ordered and Unordered Disjunction},
	Type = WS,
	Url = {http://www.polleres.net/publications/kaer-etal-2008.pdf},
	Year = 2008,
	Bdsk-Url-1 = {http://www.polleres.net/publications/kaer-etal-2008.pdf}}

{"_id":{"_str":"51f6416559ced8df440006d8"},"__v":42,"authorIDs":["545720922abc8e9f370000ae","54575c672abc8e9f370002fc","54594662b43425b772000419","546ef7045ac8e5e30d0000ae","5PFMiHGwfvbGBZwWF","5de7280d97054edf010000c3","5e02b1a419da8edf01000028","5e048450db7916df010000b1","5e06d565a0810cde0100009b","5e10e27445c12cde01000062","5e123345c196d3de01000074","5e14ba61e55ed8de01000072","5e189b4e779abfdf0100013f","5e216f7e5a651cdf010000eb","5e25b9fdf299d4de01000001","5e2d64605e7586df01000083","5e36e5e9b26a0fde0100005e","5e37d23b56571fde010000de","5e4ded1052c311f20100018e","5e51a3102793ecde010000e0","5e59a6b5ad6c7fde01000114","5e5d588ead47bcde01000072","5e60e857839e59df010000f1","A5AFuDAiNR4HEYiFD","BtzwZ6TFPsASbdqvo","DLdeXAmrbA4niYQzH","FyLDFGg993nDS2Spf","NCjPvWahWRjdP3ghB","XcyP3jptz7zE4ZLws","aiXjXMLP63k5WCt84","fTDcT5K3oSTcdxSBj","fbKNfWffDzdzubrER","haaAs2rQaQA7EaZva","nQX2P8WzFeKwcpLqd","nuWuyLnGu7YzMrn4d","pfENTBFWo85mRy3ik","rX6EShFR2rMFmQL2C","w6wHZukTjqqera7BR","woa42kCD35yCmdQTj","yPgvarsL7KAT9yfZd","yzkCNJMYNL8B3bni2","zDG3tj87ZfYXo7u9c"],"author_short":["Kärger, P.","Lopes, N.","Olmedilla, D.","Polleres, A."],"bibbaseid":"krger-lopes-olmedilla-polleres-towardslogicprogramswithorderedandunordereddisjunction-2008","bibdata":{"bibtype":"inproceedings","type":"workshop","abstract":"Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last few years. Among them, the principle of ordered disjunction was developed to express totally ordered preferences for the alternatives in rule heads. In this paper we introduce an extension of this approach called Disjunctive Logic Programs with Ordered Disjunction (DLPOD) that combines ordered disjunction with common disjunction in rule heads. By this extension, we enhance the preference notions expressible with totally ordered disjunctions to partially ordered preferences. Furthermore, we show that computing optimal stable models for DLPODs still stays in $Σ_2^p$ for head-cycle free programs and establish $Σ_3^p$ upper bounds for the general case.","author":[{"firstnames":["Philipp"],"propositions":[],"lastnames":["Kärger"],"suffixes":[]},{"firstnames":["Nuno"],"propositions":[],"lastnames":["Lopes"],"suffixes":[]},{"firstnames":["Daniel"],"propositions":[],"lastnames":["Olmedilla"],"suffixes":[]},{"firstnames":["Axel"],"propositions":[],"lastnames":["Polleres"],"suffixes":[]}],"booktitle":"Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2008)","month":"December","title":"Towards Logic Programs with Ordered and Unordered Disjunction","url":"http://www.polleres.net/publications/kaer-etal-2008.pdf","year":"2008","bdsk-url-1":"http://www.polleres.net/publications/kaer-etal-2008.pdf","bibtex":"@inproceedings{kaer-etal-2008,\n\tAbstract = {Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last few years. Among them, the principle of ordered disjunction was developed to express totally ordered preferences for the alternatives in rule heads. In this paper we introduce an extension of this approach called Disjunctive Logic Programs with Ordered Disjunction (DLPOD) that combines ordered disjunction with common disjunction in rule heads. By this extension, we enhance the preference notions expressible with totally ordered disjunctions to partially ordered preferences. Furthermore, we show that computing optimal stable models for DLPODs still stays in $\\Sigma_2^p$ for head-cycle free programs and establish $\\Sigma_3^p$ upper bounds for the general case.},\n\tAuthor = {Philipp K{\\\"a}rger and Nuno Lopes and Daniel Olmedilla and Axel Polleres},\n\tBooktitle = {Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2008)},\n\tMonth = dec,\n\tTitle = {Towards Logic Programs with Ordered and Unordered Disjunction},\n\tType = WS,\n\tUrl = {http://www.polleres.net/publications/kaer-etal-2008.pdf},\n\tYear = 2008,\n\tBdsk-Url-1 = {http://www.polleres.net/publications/kaer-etal-2008.pdf}}\n\n","author_short":["Kärger, P.","Lopes, N.","Olmedilla, D.","Polleres, A."],"key":"kaer-etal-2008","id":"kaer-etal-2008","bibbaseid":"krger-lopes-olmedilla-polleres-towardslogicprogramswithorderedandunordereddisjunction-2008","role":"author","urls":{"Paper":"http://www.polleres.net/publications/kaer-etal-2008.pdf"},"metadata":{"authorlinks":{"polleres, a":"https://bibbase.org/show?bib=www.polleres.net/mypublications.bib"}}},"bibtype":"inproceedings","biburl":"www.polleres.net/mypublications.bib","downloads":0,"keywords":[],"search_terms":["towards","logic","programs","ordered","unordered","disjunction","kärger","lopes","olmedilla","polleres"],"title":"Towards Logic Programs with Ordered and Unordered Disjunction","title_words":["towards","logic","programs","ordered","unordered","disjunction"],"year":2008,"dataSources":["cBfwyqsLFQQMc4Fss","gixxkiKt6rtWGoKSh","QfLT6siHZuHw9MqvK"]}