Computing the well-founded semantics faster
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 113-126
- https://doi.org/10.1007/3-540-59487-6_9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Autoepistemic logicJournal of the ACM, 1991
- A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiabilityThe Journal of Logic Programming, 1990
- The expressive powers of the logic programming semantics (extended abstract)Published by Association for Computing Machinery (ACM) ,1990
- The alternating fixpoint of logic programs with negationPublished by Association for Computing Machinery (ACM) ,1989
- A topological approach to dynamic graph connectivityInformation Processing Letters, 1987
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972