On the relations between stable and well-founded semantics of logic programs
From MaRDI portal
Publication:1200977
DOI10.1016/0304-3975(92)90285-NzbMath0774.68028MaRDI QIDQ1200977
Publication date: 16 January 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics, Tie-breaking semantics and structural totality, Magic Sets and their application to data integration, Soundness of abductive proof procedure with respect to constraint for non-ground abducibles, Abduction from logic programs: Semantics and complexity, A unifying view for logic programming with non-monotonic reasoning, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
Cites Work