Matching of bounded set terms in the logic language LDL++

DOI10.1016/0743-1066(95)00146-8zbMATH Open0873.68025OpenAlexW2025415897MaRDI QIDQ3129496FDOQ3129496

Authors: Natraj Arni, Sergio Greco, Domenico Saccà 

Publication date: 15 June 1997

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

Full work available at URL: https://doi.org/10.1016/0743-1066(95)00146-8

Recommendations

• \(F\)-bounded quantification and the matching relation
• Compilation of set terms in the logic data language (LDL)
• Matching logic -- extended abstract (invited talk)
• Bounded Łukasiewicz logics
• On the monotonicity of (LDL) logic programs with set.
• Bounded linear logic, revisited
• Bounded Linear Logic, Revisited
• Set-term unification in a logic database language
• Matching in description logics
• Bounded nondeterminism of logic programs

zbMATH Keywords

matching algorithm

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Cited In (4)

• Constructive negation and constraint logic programming with sets
• Compilation of set terms in the logic data language (LDL)
• Title not available (Why is that?)
• Set-term unification in a logic database language

This page was built for publication: Matching of bounded set terms in the logic language LDL++

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