Decomposition of linear recursive logic programs

DOI10.1007/3-540-53832-1_50MaRDI QIDQ4028123zbMATH OpenFDO

Authors Dietmar Seipel

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53832-1_50

zbMATH Keywords

deductive databaselinear datalog sirupsquery evaluationrecursive logic queriessidedness

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Logic programs and recursion
• Logic programming in a fragment of intuitionistic linear logic
• Foundations of linear-time logic programming
• Decomposability and its role in parallel logic-program evaluation
• Computational interpretations of linear logic
• Decidability and implementation of parametrized logic programs
• On the decomposition of datalog program mappings
• Algebra and Coalgebra in Computer Science
• Linear logic as logic programming: An abstract

Cited in

(3)

• Reconstruction of linear index expressions for reducing programs to a linear class
• scientific article; zbMATH DE number 638303 (Why is no real title available?)
• On the decomposition of datalog program mappings

This page was built for publication: Decomposition of linear recursive logic programs

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