The limits of fixed-order computation
- 1 January 1996
- book chapter
- Published by Springer Nature
- Vol. 254, 343-363
- https://doi.org/10.1007/bfb0031750
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An Extension of Van Gelder's Alternating Fixpoint to Magic ProgramsJournal of Computer and System Sciences, 1996
- Tabled evaluation with delaying for general logic programsJournal of the ACM, 1996
- Well-founded and stationary models of logic programsAnnals of Mathematics and Artificial Intelligence, 1994
- Modular stratification and magic sets for Datalog programs with negationJournal of the ACM, 1994
- XSB as an efficient deductive database enginePublished by Association for Computing Machinery (ACM) ,1994
- A procedural semantics for well-founded negation in logic programsThe Journal of Logic Programming, 1992
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Negation by default and unstratifiable logic programsTheoretical Computer Science, 1991
- Weakly Stratified Logic Programs1Fundamenta Informaticae, 1990