A non-ground realization of the stable and well-founded semantics

DOI10.1016/0304-3975(95)00207-3zbMath0872.68108OpenAlexW1977434144MaRDI QIDQ671655

Anil Nerode, Gernot Salzer, Sherry Marcus, V. S. Subrahmanian, Georg Gottlob

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00207-3

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (6)

ASPeRiX, a first-order forward chaining approach for answer set computing ⋮ Loop-separable programs and their first-order definability ⋮ On deciding subsumption problems ⋮ A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics ⋮ Soundness of abductive proof procedure with respect to constraint for non-ground abducibles ⋮ Working with ARMs: Complexity results on atomic representations of Herbrand models

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of substitutions and unifications
• Paraconsistent logic programming
• Dualities between alternative semantics for logic programming and nonmonotonic reasoning
• An Efficient Unification Algorithm

This page was built for publication: A non-ground realization of the stable and well-founded semantics