Jul 11, 2002 · Logic programming under answer set semantics is extended with a new connective called ordered disjunction. The new connective allows us to ...
scholar.google.com › citations
Logic programs with ordered disjunction (LPODs) combine ideas underlying Qualitative Choice Logic (Brewka, Benfer- hat, & Le Berre 2002) and answer set ...
Logic programs with ordered disjunction (LPODs) contain a new connective which allows representing al- ternative, ranked options for problem solutions in ...
Sep 18, 2024 · Logic programs with ordered disjunction (LPODs) add a new connective to logic programming. This connective allows us to rep- resent alternative, ...
The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. LPODs are useful for applications in design and ...
In this paper we consider a logical treatment for the ordered disjunc- tion operator × introduced by Brewka, Niemelä and Syrjänen in their. Logic Programs with ...
[PDF] Towards Logic Programs with Ordered and Unordered Disjunction*
citeseerx.ist.psu.edu › document
Our syntax simply extends Logic Programs with Ordered Disjunction from [4] with the common disjunction '∨' used in Disjunctive Logic Programming. Definition 4 ( ...
May 10, 2022 · Abstract:Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing preferential ...
Logic programs with ordered disjunction (<i>LPOD</i>s) combine ideas underlying Qualitative Choice Logic (Brewka, Benferhat, & Le Berre 2002) and answer set ...
Apr 20, 2004 · Logic programs with ordered disjunction (LPODs) contain a new connective which allows representing alternative, ranked options for problem ...