A logical characterization of the preferred models of logic programs with ordered disjunction

DOI10.1017/S1471068421000235MaRDI QIDQ5019604FDO

Authors 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)

Recommendations

• Towards logic programs with ordered and unordered disjunction
• A logical characterisation of ordered disjunction
• scientific article; zbMATH DE number 1931680
• Nested preferences in answer set programming
• On the semantics of logic programs with preferences

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• A logical characterisation of ordered disjunction
• Constructible falsity
• Qualitative choice logic
• Revisiting explicit negation in answer set programming
• Strongly equivalent logic programs
• The Semantics of Predicate Logic as a Programming Language
• Towards logic programs with ordered and unordered disjunction

Cited in

(12)

• Ordered model trees: A normal form for disjunctive deductive databases
• Towards logic programs with ordered and unordered disjunction
• scientific article; zbMATH DE number 5827849 (Why is no real title available?)
• A general framework for preferences in answer set programming
• Default Logics with Preference Order: Principles and Characterisations
• A logical characterisation of ordered disjunction
• Foundations of Information and Knowledge Systems
• Nested preferences in answer set programming
• Translating LPOD and CR-\(\mathrm{Prolog}_2\) into standard answer set programs
• Choice logics and their computational properties
• Sequent calculi for choice logics
• Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective

This page was built for publication: A logical characterization of the preferred models of logic programs with ordered disjunction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019604)