A semantic framework for preference handling in answer set programming

DOI10.1017/S1471068403001844MaRDI QIDQ4815034zbMATH OpenFDO

Authors Torsten Schaub, Kewen Wang

Publication date 19 August 2004

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

answer set programmingpreferencespriorities.

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Logic programming (68N17) Logic in artificial intelligence (68T27) Mechanization of proofs and logical operations (03B35) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 1844462
• A selective semantics for logic programs with preferences
• A framework for compiling preferences in logic programs
• Preferred first-order answer set programs
• Preferred answer sets for extended logic programs

Cited in

(9)

• Computing preferred answer sets by meta-interpretation in Answer Set Programming
• A selective semantics for logic programs with preferences
• scientific article; zbMATH DE number 1844462 (Why is no real title available?)
• Preferred first-order answer set programs
• Strong order equivalence
• scientific article; zbMATH DE number 2063029 (Why is no real title available?)
• A Preference-Based Semantics for CTD Reasoning
• A general framework for preferences in answer set programming
• Implementing preferences with asprin

This page was built for publication: A semantic framework for preference handling in answer set programming

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