ML Anthology

Logic Programming with Ordered Disjunction

Gerhard Brewka
AAAI 2002 pp. 100-105
doi:10.5555/777092.777111 /aaai/2002/brewka2002aaai-logic/

Abstract

Logic programs with ordered disjunction (LPODs) combine ideas underlying Qualitative Choice Logic (Brewka, Benferhat, & Le Berre 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 × 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.

PDF AAAI Semantic Scholar

Cite

Text

Brewka. "Logic Programming with Ordered Disjunction." AAAI Conference on Artificial Intelligence, 2002. doi:10.5555/777092.777111

Markdown

[Brewka. "Logic Programming with Ordered Disjunction." AAAI Conference on Artificial Intelligence, 2002.](https://mlanthology.org/aaai/2002/brewka2002aaai-logic/) doi:10.5555/777092.777111

BibTeX

@inproceedings{brewka2002aaai-logic,
  title     = {{Logic Programming with Ordered Disjunction}},
  author    = {Brewka, Gerhard},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2002},
  pages     = {100-105},
  doi       = {10.5555/777092.777111},
  url       = {https://mlanthology.org/aaai/2002/brewka2002aaai-logic/}
}