A logical characterization of the preferred models of logic programs with ordered disjunction
From MaRDI portal
(Redirected from Publication:5019604)
Recommendations
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)- Default Logics with Preference Order: Principles and Characterisations
- Sequent calculi for choice logics
- Translating LPOD and CR-\(\mathrm{Prolog}_2\) into standard answer set programs
- scientific article; zbMATH DE number 5827849 (Why is no real title available?)
- A logical characterisation of ordered disjunction
- A general framework for preferences in answer set programming
- 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
- Choice logics and their computational properties
- Foundations of Information and Knowledge Systems
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)