Compilation of set terms in the logic data language (LDL)

DOI10.1016/0743-1066(92)90040-AMaRDI QIDQ3992237zbMATH OpenOpenAlexFDO

Authors Oded Shmueli, Shalom Tsur, Carlo Zaniolo

Publication date 13 August 1992

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(92)90040-a

zbMATH Keywords

Horn-clause logic-programming languageHorn-clause programsrewritingset-term matching

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17) Theory of compilers and interpreters (68N20) Artificial intelligence (68T99)

Recommendations

• Matching of bounded set terms in the logic language LDL++
• scientific article; zbMATH DE number 4053071
• Magic templates: a spellbinding approach to logic programs
• Translation of logic programs into functional fixpoint equations
• {log}: A language for programming in logic with finite sets

Cited in

(7)

• On the monotonicity of (LDL) logic programs with set.
• A deductive database approach for complex objects
• A safe relational calculus for functional logic deductive databases
• Matching of bounded set terms in the logic language LDL++
• Set-term unification in a logic database language
• Interval propagation to reason about sets: Definition and implementation of a practical language
• Database query languages and functional logic programming

This page was built for publication: Compilation of set terms in the logic data language (LDL)

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