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

DOI10.1017/S1471068403001753zbMath1079.68096OpenAlexW2167505882MaRDI QIDQ4815030

Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter

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

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

Related Items (7)

Algorithms for Solving Satisfiability Problems with Qualitative Preferences ⋮ Logic Programming with Defaults and Argumentation Theories ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ Computing weighted solutions in ASP: representation-based method vs. search-based method ⋮ Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study ⋮ Complex optimization in answer set programming ⋮ Computing defeasible meta-logic

Uses Software

• Smodels

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