Restricted Delta-Trees and Reduction Theorems in Multiple-Valued Logics

 

Abstract

Citation

Please, cite this work as:

[GOA02] I. P. de Guzmán, M. Ojeda-Aciego, and Agust'. “Restricted Delta-Trees and Reduction Theorems in Multiple-Valued Logics”. In: Advances in Artificial Intelligence - IBERAMIA 2002, 8th Ibero-American Conference on AI, Seville, Spain, November 12-15, 2002, Proceedings. Ed. by F. J. Garijo, J. C. R. Santos and M. Toro. Vol. 2527. Lecture Notes in Computer Science. Springer, 2002, pp. 161-171. DOI: 10.1007/3-540-36131-6_17. URL: https://doi.org/10.1007/3-540-36131-6_17.

BibTeX

@InProceedings{Guzman2002a,
     author = {Inman P. {de Guzm{’a}n} and Manuel Ojeda-Aciego and Agust'Valverde},
     booktitle = {Advances in Artificial Intelligence - {IBERAMIA} 2002, 8th Ibero-American Conference on AI, Seville, Spain, November 12-15, 2002, Proceedings},
     title = {Restricted Delta-Trees and Reduction Theorems in Multiple-Valued Logics},
     year = {2002},
     editor = {Francisco J. Garijo and Jos{’e} Crist{’o}bal Riquelme Santos and Miguel Toro},
     pages = {161–171},
     publisher = {Springer},
     series = {Lecture Notes in Computer Science},
     volume = {2527},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/conf/iberamia/GuzmanOV02.bib},
     doi = {10.1007/3-540-36131-6_17},
     timestamp = {Tue, 14 May 2019 10:00:40 +0200},
     url = {https://doi.org/10.1007/3-540-36131-6_17},
}

Bibliometric data

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

Restricted Delta-Trees and Reduction Theorems in Multiple-Valued Logics

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] I. Fortes, M. Galán, G. Aguilera, et al. “A logic with imprecise probabilities and an application to automated reasoning using rewriting techniques”. In: Fuzzy Sets and Systems 218 (May. 2013), p. 53–72. ISSN: 0165-0114. DOI: 10.1016/j.fss.2012.08.004. URL: http://dx.doi.org/10.1016/j.fss.2012.08.004.

[2] M. Ojeda-Aciego and A. Valverde. “tascpl: TAS Solver for Classical Propositional Logic”. In: Logics in Artificial Intelligence. Springer Berlin Heidelberg, 2004, p. 738–741. ISBN: 9783540302278. DOI: 10.1007/978-3-540-30227-8_70. URL: http://dx.doi.org/10.1007/978-3-540-30227-8_70.