Dynamic reordering of alternatives for definite logic programs

DOI10.1016/j.cl.2008.04.002zbMath1387.68058OpenAlexW2048620890MaRDI QIDQ1749236

Hai-Feng H.-F. Guo, Gopal G. Gupta

Publication date: 16 May 2018

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cl.2008.04.002

zbMATH Keywords

fixed pointlogic programmingSLD resolutionDRA resolutiontabled resolution

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Can you answer while you wait?

Uses Software

• XSB

Cites Work

• Semantics-based program analysis for logic-based languages using XSB
• Efficient top-down computation of queries under the well-founded semantics
• Tabulated resolution for the well-founded semantics
• Tabled evaluation with delaying for general logic programs
• Linear tabulated resolution based on Prolog control strategy
• An External Module for Implementing Linear Tabling in Prolog
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic reordering of alternatives for definite logic programs