A non-ground realization of the stable and well-founded semantics
From MaRDI portal
Publication:671655
DOI10.1016/0304-3975(95)00207-3zbMATH Open0872.68108OpenAlexW1977434144MaRDI QIDQ671655FDOQ671655
Authors: Sherry Marcus, Gernot Salzer, V. S. Subrahmanian, Georg Gottlob, Anil Nerode 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Paraconsistent logic programming
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Efficient Unification Algorithm
- Properties of substitutions and unifications
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Loop-separable programs and their first-order definability
- A nondeterministic well-founded semantics
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- An extensional Kleene realizability semantics for the Minimalist Foundation
- On deciding subsumption problems
- Mixed integer programming methods for computing nonmonotonic deductive databases
- Equivalence of well-founded and stable semantics
- Working with ARMs: Complexity results on atomic representations of Herbrand models
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
Uses Software
This page was built for publication: A non-ground realization of the stable and well-founded semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671655)
