A framework for compiling preferences in logic programs
From MaRDI portal
Publication:4452601
DOI10.1017/S1471068402001539zbMATH Open1105.68323OpenAlexW2174235632MaRDI QIDQ4452601FDOQ4452601
Torsten Schaub, James Delgrande, Hans Tompits
Publication date: 1 March 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068402001539
Recommendations
Cited In (24)
- A semantic framework for preference handling in answer set programming
- Logic Programming
- Computing Utility from Weighted Description Logic Preference Formulas
- Title not available (Why is that?)
- Revealed preference in argumentation: algorithms and applications
- Logic Programming and Nonmonotonic Reasoning
- Strong order equivalence
- Complex optimization in answer set programming
- Title not available (Why is that?)
- Argumentation for Practical Reasoning: An Axiomatic Approach
- Title not available (Why is that?)
- A Logic Framework for P2P Deductive Databases
- A Preference-Based Semantics for CTD Reasoning
- Logic Programming with Defaults and Argumentation Theories
- On the Semantics of Logic Programs with Preferences
- An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents.
- An axiomatic analysis of structured argumentation with priorities
- Justifications for logic programs under answer set semantics
- Preference logic grammars
- Translating LPOD and CR-Prolog2into standard answer set programs
- Fundamental properties of attack relations in structured argumentation with priorities
- Logic programming with solution preferences
- Preferred First-Order Answer Set Programs
- Integrated preference argumentation and applications in consumer behaviour analyses
Uses Software
This page was built for publication: A framework for compiling preferences in logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452601)
