The limits of fixed-order computation

DOI10.1016/S0304-3975(99)00341-2zbMath0974.68111WikidataQ58968403 ScholiaQ58968403MaRDI QIDQ5940930

Terrance Swift, David S. Warren, Konstantinos Sagonas

Publication date: 20 August 2001

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

zbMATH Keywords

well-founded semanticsnon-monotonic reasoningstratification theoriestabling

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items

XSB: Extending Prolog with Tabled Logic Programming, An abstract machine for fixed-order dynamically stratified programs

Uses Software

• Smodels
• XSB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The alternating fixpoint of logic programs with negation
• Negation by default and unstratifiable logic programs
• A logic programming system for nonmonotonic reasoning
• An extension of Van Gelder's alternating fixpoint to magic programs
• Tabulated resolution for the well-founded semantics
• A procedural semantics for well-founded negation in logic programs
• HiLog: A foundation for higher-order logic programming
• Efficient access mechanisms for tabled logic programs
• The well-founded semantics for general logic programs
• Modular stratification and magic sets for Datalog programs with negation
• Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models
• Tabled evaluation with delaying for general logic programs