On the equivalence of semantics for normal logic programs
From MaRDI portal
Publication:4327428
DOI10.1016/0743-1066(94)00023-YzbMath0830.68030MaRDI QIDQ4327428
Publication date: 6 April 1995
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items (9)
Oscillating Behavior of Logic Programs ⋮ The expressive powers of stable models for bound and unbound DATALOG queries ⋮ A unifying view for logic programming with non-monotonic reasoning ⋮ Iterative belief revision in extended logic programming ⋮ A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics ⋮ Expressive power and complexity of partial models for disjunctive deductive databases ⋮ Soundness of abductive proof procedure with respect to constraint for non-ground abducibles ⋮ On the equivalence between logic programming semantics and argumentation semantics ⋮ Functional queries in datalog
This page was built for publication: On the equivalence of semantics for normal logic programs