Non-commutativity and Expressive Deductive Logic Databases

uncategorised
Authors

Stanislav Krajci

Rastislav Lencses

Jesús Medina

Manuel Ojeda-Aciego

Agustín Valverde

Peter Vojtás

Published

1 January 2002

Publication details

Logics in Artificial Intelligence, European Conference, {JELIA} 2002, Cosenza, Italy, September, 23-26, Proceedings , Lecture Notes in Computer Science vol. 2424, pages 149–160.

Links

DOI

 

Abstract

Citation

Please, cite this work as:

[Kra+02] S. Krajci, R. Lencses, J. Medina, et al. “Non-commutativity and Expressive Deductive Logic Databases”. In: Logics in Artificial Intelligence, European Conference, JELIA 2002, Cosenza, Italy, September, 23-26, Proceedings. Ed. by S. Flesca, S. Greco, N. Leone and G. Ianni. Vol. 2424. Lecture Notes in Computer Science. Springer, 2002, pp. 149-160. DOI: 10.1007/3-540-45757-7_13. URL: https://doi.org/10.1007/3-540-45757-7_13.

@InProceedings{Krajci2002a,
     author = {Stanislav Krajci and Rastislav Lencses and Jes{’u}s Medina and Manuel Ojeda-Aciego and Agust'Valverde and Peter Vojt{’a}s},
     booktitle = {Logics in Artificial Intelligence, European Conference, {JELIA} 2002, Cosenza, Italy, September, 23-26, Proceedings},
     title = {Non-commutativity and Expressive Deductive Logic Databases},
     year = {2002},
     editor = {Sergio Flesca and Sergio Greco and Nicola Leone and Giovambattista Ianni},
     pages = {149–160},
     publisher = {Springer},
     series = {Lecture Notes in Computer Science},
     volume = {2424},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/conf/jelia/KrajciLMOVV02.bib},
     doi = {10.1007/3-540-45757-7_13},
     timestamp = {Thu, 07 Jan 2021 00:00:00 +0100},
     url = {https://doi.org/10.1007/3-540-45757-7_13},
}

Bibliometric data

The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.

Non-commutativity and Expressive Deductive Logic Databases

Cites

The following graph plots the number of cites received by this work from its publication, on a yearly basis.

Papers citing this work

The following is a non-exhaustive list of papers that cite this work:

[1] J. Kalafut and A. Mesiarová-Zemánková. “Decomposition of pseudo-uninorms with continuous underlying functions via ordinal sum”. In: Information Sciences 690 (Feb. 2025), p. 121573. ISSN: 0020-0255. DOI: 10.1016/j.ins.2024.121573. URL: http://dx.doi.org/10.1016/j.ins.2024.121573.