A framework for compiling preferences in logic programs

DOI10.1017/S1471068402001539zbMath1105.68323OpenAlexW2174235632MaRDI QIDQ4452601

Torsten Schaub, James P. 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

zbMATH Keywords

answer set semantics

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Logic programming (68N17)

Related Items (13)

Strong order equivalence ⋮ Translating LPOD and CR-Prolog₂into standard answer set programs ⋮ Argumentation for Practical Reasoning: An Axiomatic Approach ⋮ Logic Programming with Defaults and Argumentation Theories ⋮ Integrated preference argumentation and applications in consumer behaviour analyses ⋮ A Logic Framework for P2P Deductive Databases ⋮ Fundamental properties of attack relations in structured argumentation with priorities ⋮ An axiomatic analysis of structured argumentation with priorities ⋮ An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents. ⋮ Revealed preference in argumentation: algorithms and applications ⋮ Preferred First-Order Answer Set Programs ⋮ Justifications for logic programs under answer set semantics ⋮ Complex optimization in answer set programming

Uses Software

• Smodels

This page was built for publication: A framework for compiling preferences in logic programs