A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction

DOI10.1017/S1471068421000235MaRDI QIDQ5019604

Angelos Charalambidis, Panos Rondogiannis, Antonis Troumpoukis

Publication date: 10 January 2022

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.03369

zbMATH Keywords

preferenceslogic of here-and-thereanswer setsordered disjunction

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (3)

Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective ⋮ A general framework for preferences in answer set programming ⋮ Choice logics and their computational properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Qualitative choice logic
• The Semantics of Predicate Logic as a Programming Language
• Revisiting Explicit Negation in Answer Set Programming
• Strongly equivalent logic programs
• Constructible falsity

This page was built for publication: A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction