Computing preferred answer sets by meta-interpretation in Answer Set Programming

DOI10.1017/S1471068403001753MaRDI QIDQ4815030zbMATH OpenOpenAlexFDO

Authors Thomas Eiter, Wolfgang Faber, N. Leone, Gerald Pfeifer

Publication date 19 August 2004

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

Full work available at URL https://doi.org/10.1017/s1471068403001753

zbMATH Keywords

meta-interpretationAnswer Set Programmingpreference semantics.

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Recommendations

• A selective semantics for logic programs with preferences
• Computing preferred answer sets in answer set programming
• Complex optimization in answer set programming
• A semantic framework for preference handling in answer set programming
• Preferred answer sets for extended logic programs

Cited in

(8)

• Computing weighted solutions in ASP: representation-based method vs. search-based method
• Complex optimization in answer set programming
• scientific article; zbMATH DE number 2063029 (Why is no real title available?)
• Logic Programming with Defaults and Argumentation Theories
• Computing defeasible meta-logic
• Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• Complexity results for answer set programming with bounded predicate arities and implications

Describes a project that uses

Uses Software

• Smodels

This page was built for publication: Computing preferred answer sets by meta-interpretation in Answer Set Programming

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