An abstract machine for fixed-order dynamically stratified programs

DOI10.1007/3-540-61511-3_98zbMATH Open1412.68032OpenAlexW1572167134WikidataQ58968748 ScholiaQ58968748MaRDI QIDQ4647532FDOQ4647532

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

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

Recommendations

• The limits of fixed-order computation
• Static filtering on stratified programs
• An abstract machine for efficiently computing queries to well-founded models
• Tabled evaluation with delaying for general logic programs
• Modular stratification and magic sets for Datalog programs with negation

zbMATH Keywords

logic programmingchoice pointcompletion operationexecution environment

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• The limits of fixed-order computation
• Tabled evaluation with delaying for general logic programs
• A procedural semantics for well-founded negation in logic programs
• Modular stratification and magic sets for Datalog programs with negation
• Efficient top-down computation of queries under the well-founded semantics
• Title not available (Why is that?)
• Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models

Cited In (2)

• Static filtering on stratified programs
• Logic Programming and Nonmonotonic Reasoning

Uses Software

• XSB

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

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