Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs

DOI10.1007/978-3-642-04238-6_9MaRDI QIDQ3643107zbMATH OpenOpenAlexFDO

Authors Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, N. Leone

Publication date 10 November 2009

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04238-6_9

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Finitely recursive programs: decidability and bottom-up computation
• Disjunctive ASP with functions: decidable queries and effective computation
• scientific article; zbMATH DE number 2090537
• Magic templates: a spellbinding approach to logic programs
• Computable Functions in ASP: Theory and Implementation

Cited in

(4)

• Finitely recursive programs: decidability and bottom-up computation
• Disjunctive ASP with functions: decidable queries and effective computation
• On Finitely Recursive Programs
• scientific article; zbMATH DE number 5199142 (Why is no real title available?)

Describes a project that uses

Uses Software

• DLV-Complex

This page was built for publication: Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs

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