Computing the well-founded semantics faster
From MaRDI portal
Publication:5101445
DOI10.1007/3-540-59487-6_9zbMATH Open1496.68083OpenAlexW1497544880MaRDI QIDQ5101445FDOQ5101445
Authors: Kenneth A. Berman, John S. Schlipf, John V. Franco 
Publication date: 30 August 2022
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59487-6_9
Recommendations
Analysis of algorithms (68W40) Logic programming (68N17) Semantics in the theory of computing (68Q55)
Cites Work
- The well-founded semantics for general logic programs
- Depth-First Search and Linear Graph Algorithms
- Autoepistemic logic
- A topological approach to dynamic graph connectivity
- A kripke-kleene semantics for logic programs*
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Efficient computation of the well-founded semantics over big data
- Title not available (Why is that?)
- Safe computation of the well-founded semantics of datalog queries
- On Signings and the Well-Founded Semantics
- Loop checking and the well-founded semantics
- Title not available (Why is that?)
- Layerings of logic programs -- layer decomposable semantics and incremental model computation
- Polynomial approximation to well-founded semantics for logic programs with generalized atoms: case studies
- Heterogeneous active agents. III: Polynomially implementable agents
- On the problem of computing the well-founded semantics
- Transformation-based bottom-up computation of the well-founded model
This page was built for publication: Computing the well-founded semantics faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101445)
