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.
Partially supported by Slovak grants VEGA 1/7557/20.
Partially supported by Spanish DGI project BFM2000-1054-C02-02.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Ciesielski, R. Flagg, and R. Kopperman. Polish spaces, computable approximations, and bitopological spaces. Topology and applications, 119(3):241–256, 2002.
C.V. Damásio and L. Moniz Pereira. Monotonic and residuated logic programs. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU’01, pages 748–759. Lect. Notes in Artificial Intelligence, 2143, 2001.
A. Dekhtyar and V. S. Subrahmanian. Hybrid probabilistic programs. J. of Logic Programming, 43:187–250, 2000.
T. Eiter, T. Lukasiewicz, and M. Walter. A data model and algebra for probabilistic complex values. Annals of Mathematics and Artificial Intelligence, 33(2–4):205–252, 2001.
M. Kifer and V. S. Subrahmanian. Theory of generalized annotated logic programming and its applications. J. of Logic Programming, 12:335–367, 1992.
S. Krajči, R. Lencses, and P. Vojtáš. Acomparison of fuzzy and annotated logic programming. Fuzzy Sets and Systems, 2002. Submitted.
L.V.S. Lakshmanan and F. Sadri. On a theory of probabilistic deductive databases. Theory and Practice of Logic Programming, 1(1):5–42, 2001.
J. Medina, M. Ojeda-Aciego, and P. Vojtáš. Multi-adjoint logic programming with continuous semantics. In Logic Programming and Non-Monotonic Reasoning, LPNMR’01, pages 351–364. Lect. Notes in Artificial Intelligence 2173, 2001.
J. Medina, M. Ojeda-Aciego, and P. Vojtáš. A procedural semantics for multi-adjoint logic programming. In Progress in Artificial Intelligence, EPIA’01, pages 290–297. Lect. Notes in Artificial Intelligence 2258, 2001.
E. Naito, J. Ozawa, I. Hayashi, and N. Wakami. Aproposal of a fuzzy connective with learning function. In P. Bosc and J. Kaczprzyk, editors, Fuzziness Database Management Systems, pages 345–364. Physica Verlag, 1995.
J. Pokorný and P. Vojtáš. A data model for flexible querying. In Advances in Databases and Information Systems, ADBIS’01, pages 280–293. Lect. Notes in Computer Science 2151, 2001.
C.J. van Alten. Representable biresiduated lattices. J. Algebra, 247:672–691, 2002.
P. Vojtáš and L. Paulík. Soundness and completeness of non-classical extended SLDresolution. In Extensions of Logic Programming, ELP’96, pages 289–301. Lect. Notes in Comp. Sci. 1050, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krajči, S., Lencses, R., Medina, J., Ojeda-Aciego, M., Valverde, A., Vojtáš, P. (2002). Non-commutativity and Expressive Deductive Logic Databases. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_13
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44190-8
Online ISBN: 978-3-540-45757-2
eBook Packages: Springer Book Archive