The limits of fixed-order computation
- 7 March 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 254 (1-2) , 465-499
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Efficient access mechanisms for tabled logic programsThe Journal of Logic Programming, 1999
- An abstract machine for tabled execution of fixed-order stratified logic programsACM Transactions on Programming Languages and Systems, 1998
- Tabulated resolution for the well-founded semanticsThe Journal of Logic Programming, 1998
- Fully local and efficient evaluation of alternating fixed pointsLecture Notes in Computer Science, 1998
- Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded modelsThe Journal of Logic Programming, 1997
- An Extension of Van Gelder's Alternating Fixpoint to Magic ProgramsJournal of Computer and System Sciences, 1996
- Modular stratification and magic sets for Datalog programs with negationJournal of the ACM, 1994
- HiLog: A foundation for higher-order logic programmingThe Journal of Logic Programming, 1993
- A procedural semantics for well-founded negation in logic programsThe Journal of Logic Programming, 1992
- Negation by default and unstratifiable logic programsTheoretical Computer Science, 1991