Minimal Logic Programs

DOI10.1007/978-3-540-74610-2_8zbMath1213.68171OpenAlexW1843148560MaRDI QIDQ3608649

No author found.

Publication date: 5 March 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74610-2_8

zbMATH Keywords

logic programminganswer set programmingminimisation of Boolean and multi-valued functions

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (16)

Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version ⋮ The Modal Logic of Equilibrium Models ⋮ SAT-Based Formula Simplification ⋮ Temporal equilibrium logic: a survey ⋮ A denotational semantics for equilibrium logic ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Syntactic ASP forgetting with forks ⋮ Unnamed Item ⋮ Capturing equilibrium models in modal logic ⋮ Equivalence for the \(G_3^\prime\)-stable models semantics ⋮ Syntactic ASP forgetting with forks ⋮ On syntactic forgetting under uniform equivalence ⋮ Forgetting auxiliary atoms in forks ⋮ Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There ⋮ Quantified Equilibrium Logic and Foundations for Answer Set Programs

This page was built for publication: Minimal Logic Programs