Computing the well-founded semantics faster

DOI10.1007/3-540-59487-6_9zbMath1496.68083OpenAlexW1497544880MaRDI QIDQ5101445

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) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (3)

On Signings and the Well-Founded Semantics ⋮ Unnamed Item ⋮ Heterogeneous active agents. III: Polynomially implementable agents

Cites Work

• Unnamed Item
• Unnamed Item
• A topological approach to dynamic graph connectivity
• A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
• A kripke-kleene semantics for logic programs*
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Computing the well-founded semantics faster