A logical characterization of the preferred models of logic programs with ordered disjunction
From MaRDI portal
Publication:5019604
DOI10.1017/S1471068421000235MaRDI QIDQ5019604FDOQ5019604
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Strongly equivalent logic programs
- Constructible falsity
- The Semantics of Predicate Logic as a Programming Language
- Revisiting Explicit Negation in Answer Set Programming
- Qualitative choice logic
- Towards logic programs with ordered and unordered disjunction
- A logical characterisation of ordered disjunction
Cited In (11)
- Default Logics with Preference Order: Principles and Characterisations
- Sequent calculi for choice logics
- Title not available (Why is that?)
- A general framework for preferences in answer set programming
- A logical characterisation of ordered disjunction
- Towards logic programs with ordered and unordered disjunction
- Ordered model trees: A normal form for disjunctive deductive databases
- Nested preferences in answer set programming
- Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
- Foundations of Information and Knowledge Systems
- Choice logics and their computational properties
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)
