Reduction Theorems for Boolean Formulas Using Delta-Trees
Abstract
Citation
Please, cite this work as:
[Gut+00] G. Gutiérrez, I. P. de Guzmán, J. Mart', et al. “Reduction Theorems for Boolean Formulas Using Delta-Trees”. In: Logics in Artificial Intelligence, European Workshop, JELIA 2000 Malaga, Spain, September 29 - October 2, 2000, Proceedings. Ed. by M. Ojeda-Aciego, I. P. de Guzmán, G. Brewka and L. Pereira. Vol. 1919. Lecture Notes in Computer Science. Springer, 2000, pp. 179-192. DOI: 10.1007/3-540-40006-0_13. URL: https://doi.org/10.1007/3-540-40006-0_13.
Papers citing this work
The following is a non-exhaustive list of papers that cite this work:
[1] P. Cordero, M. Enciso, and I. de Guzmán. “Bases for closed sets of implicants and implicates in temporal logic”. In: Acta Informatica 38.9 (Aug. 2002), p. 599–619. ISSN: 1432-0525. DOI: 10.1007/s00236-002-0087-2. URL: http://dx.doi.org/10.1007/s00236-002-0087-2.
[2] P. Cordero, G. Gutiérrez, J. Martínez, et al. “A New Algebraic Tool for Automatic Theorem Provers”. In: Annals of Mathematics and Artificial Intelligence 42.4 (Dec. 2004), p. 369–398. ISSN: 1012-2443. DOI: 10.1023/b:amai.0000038312.77514.3c. URL: http://dx.doi.org/10.1023/b:amai.0000038312.77514.3c.
[3] J. Martínez, G. Gutiérrez, I. de Guzmán, et al. “Generalizations of lattices via non-deterministic operators”. In: Discrete Mathematics 295.1–3 (May. 2005), p. 107–141. ISSN: 0012-365X. DOI: 10.1016/j.disc.2004.08.043. URL: http://dx.doi.org/10.1016/j.disc.2004.08.043.