On the relations between stable and well-founded semantics of logic programs
From MaRDI portal
Publication:1200977
DOI10.1016/0304-3975(92)90285-NzbMATH Open0774.68028OpenAlexW2093089155MaRDI QIDQ1200977FDOQ1200977
Authors: Phan Minh Dung 
Publication date: 16 January 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90285-n
Recommendations
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Contributions to the stable model semantics of logic programs with negation
- Equivalence of well-founded and stable semantics
- From here to there: Stable negation in logic programming
- A tutorial on the well-founded semantics
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A kripke-kleene semantics for logic programs*
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (24)
- Abduction in well-founded semantics and generalized stable models via tabled dual programs
- A unifying view for logic programming with non-monotonic reasoning
- Abduction from logic programs: Semantics and complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stable-unstable semantics: Beyond NP with normal logic programs
- Magic Sets and their application to data integration
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
- On the expressibility of stable logic programming
- Characterising and Explaining Inconsistency in Logic Programs
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- On Signings and the Well-Founded Semantics
- Title not available (Why is that?)
- Generality Relations in Answer Set Programming
- MICAI 2004: Advances in Artificial Intelligence
- Recursive rules with aggregation: a simple unified semantics
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
- Well-Founded and Partial Stable Semantics Logical Aspects
- Computing only minimal answers in disjunctive deductive databases
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Equivalence of well-founded and stable semantics
- Complexity of super-coherence problems in ASP
- 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
This page was built for publication: On the relations between stable and well-founded semantics of logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200977)
