Logic Programming with Ordered Disjunction
| dc.creator | Brewka, Gerhard | |
| dc.date | 2002-07-11 | |
| dc.date.accessioned | 2026-07-07T03:18:38Z | |
| dc.date.available | 2026-07-07T03:18:38Z | |
| dc.description | Logic programs with ordered disjunction (LPODs) combine ideas underlying Qualitative Choice Logic (Brewka et al. KR 2002) and answer set programming. Logic programming under answer set semantics is extended with a new connective called ordered disjunction. The new connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: A \times B 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. LPODs are useful for applications in design and configuration and can serve as a basis for qualitative decision making. | |
| dc.identifier | https://arxiv.org/abs/cs/0207042 | |
| dc.identifier | http://arxiv.org/abs/cs/0207042 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31196 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | I.2.4 | |
| dc.title | Logic Programming with Ordered Disjunction | |
| dc.type | text |