Computing the well-founded semantics faster

DOI10.1007/3-540-59487-6_9MaRDI QIDQ5101445zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 1696828
• On the problem of computing the well-founded semantics
• Efficient top-down computation of queries under the well-founded semantics
• Efficient Computation of the Well-Founded Model Using Update Propagation
• A tutorial on the well-founded semantics

Cites work

• scientific article; zbMATH DE number 741348 (Why is no real title available?)
• scientific article; zbMATH DE number 1453058 (Why is no real title available?)
• A kripke-kleene semantics for logic programs*
• A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
• A topological approach to dynamic graph connectivity
• Autoepistemic logic
• Depth-First Search and Linear Graph Algorithms
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• The well-founded semantics for general logic programs

Cited in

(11)

• Efficient computation of the well-founded semantics over big data
• scientific article; zbMATH DE number 1696828 (Why is no real title available?)
• Safe computation of the well-founded semantics of datalog queries
• On Signings and the Well-Founded Semantics
• Loop checking and the well-founded semantics
• scientific article; zbMATH DE number 7453118 (Why is no real title available?)
• 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)