Semantics of (disjunctive) logic programs based on partial evaluation

DOI10.1016/S0743-1066(98)10030-4zbMath0946.68088MaRDI QIDQ4700442

Jürgen Dix, Stefan Brass

Publication date: 1 November 1999

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

zbMATH Keywords

logic programming semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (16)

A Selective Semantics for Logic Programs with Preferences ⋮ Strong order equivalence ⋮ Preserving Strong Equivalence while Forgetting ⋮ Dealing with explicit preferences and uncertainty in answer set programming ⋮ Characterizations of the stable semantics by partial evaluation ⋮ Random logic programs: Linear model ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ On the limits of forgetting in answer set programming ⋮ Partial equilibrium logic ⋮ Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs ⋮ Equivalence for the \(G_3^\prime\)-stable models semantics ⋮ Closed world assumption for disjunctive reasoning ⋮ Syntactic ASP forgetting with forks ⋮ On syntactic forgetting under uniform equivalence ⋮ Disjunctive logic programs, answer sets, and the cut rule ⋮ Engineering an Incremental ASP Solver

This page was built for publication: Semantics of (disjunctive) logic programs based on partial evaluation