An abstract machine for fixed-order dynamically stratified programs

DOI10.1007/3-540-61511-3_98zbMath1412.68032OpenAlexW1572167134WikidataQ58968748 ScholiaQ58968748MaRDI QIDQ4647532

Konstantinos Sagonas, David S. Warren, Terrance Swift

Publication date: 15 January 2019

Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61511-3_98

zbMATH Keywords

logic programmingchoice pointcompletion operationexecution environment

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• XSB

Cites Work

• Unnamed Item
• Efficient top-down computation of queries under the well-founded semantics
• A procedural semantics for well-founded negation in 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
• The limits of fixed-order computation

This page was built for publication: An abstract machine for fixed-order dynamically stratified programs