The limits of fixed-order computation

DOI10.1016/S0304-3975(99)00341-2MaRDI QIDQ5940930zbMATH OpenDBLPWikidataFDO

Authors K. Sagonas, Terrance Swift, David S. Warren

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(99)00341-2

zbMATH Keywords

non-monotonic reasoningstratification theoriestablingwell-founded semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• On some computational orders of convergence
• scientific article; zbMATH DE number 6426780
• Limits of computation. From a programming perspective
• Complexity of fixed point computation
• Computational complexity of fixed points
• scientific article; zbMATH DE number 2085171
• Computability of Fraïssé limits
• Third-Order Computation and Bounded Arithmetic
• scientific article; zbMATH DE number 1344922
• scientific article; zbMATH DE number 784042

Cites work

• A logic programming system for nonmonotonic reasoning
• A procedural semantics for well-founded negation in logic programs
• An extension of Van Gelder's alternating fixpoint to magic programs
• Efficient access mechanisms for tabled logic programs
• HiLog: A foundation for higher-order logic programming
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 4147555 (Why is no real title available?)
• scientific article; zbMATH DE number 1332641 (Why is no real title available?)
• Modular stratification and magic sets for Datalog programs with negation
• Negation by default and unstratifiable logic programs
• Tabled evaluation with delaying for general logic programs
• Tabulated resolution for the well-founded semantics
• The alternating fixpoint of logic programs with negation
• The well-founded semantics for general logic programs
• Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models

Cited in

(7)

• On the limits of computations with the floor function
• XSB: extending Prolog with tabled logic programming
• From heaps of matches to the limits of computability
• Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models
• An abstract machine for fixed-order dynamically stratified programs
• Logic Programming and Nonmonotonic Reasoning
• Static filtering on stratified programs

Describes a project that uses

Uses Software

• XSB
• Smodels

This page was built for publication: The limits of fixed-order computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5940930)