Abstract
The procedural semantics of multi-adjoint logic programming is used for providing a model-theoretic semantics for a data model.A translation method for deductive logic databases is presented for obtaining a relational algebra with classical projection and enriched parametric join operator with aggregations. The use of non-commutative conjunctors allows for a model of different degrees of granulation and precision, whereas expressiveness is achieved by using multiplevalued connectives. © 2002 Springer-Verlag.
Cite
CITATION STYLE
Krajči, S., Lencses, R., Medina, J., Ojeda-Aciego, M., Valverde, A., & Vojtáš, P. (2002). Non-commutativity and expressive deductive logic databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2424 LNAI, pp. 149–160). Springer Verlag. https://doi.org/10.1007/3-540-45757-7_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
