Satisfiability Testing for Boolean Formulas Using Delta-trees

 

Abstract

Citation

Please, cite this work as:

[Gut+02] G. Gutiérrez, I. P. de Guzmán, J. Mart', et al. “Satisfiability Testing for Boolean Formulas Using Delta-trees”. In: Stud Logica 72.1 (2002), pp. 85-112. DOI: 10.1023/A:1020530109551. URL: https://doi.org/10.1023/A:1020530109551.

BibTeX

@Article{Gutierrez2002,
     author = {Gloria Guti{’e}rrez and Inman P. {de Guzm{’a}n} and Javier Mart'and Manuel Ojeda-Aciego and Agust'Valverde},
     journal = {Stud Logica},
     title = {Satisfiability Testing for Boolean Formulas Using Delta-trees},
     year = {2002},
     number = {1},
     pages = {85–112},
     volume = {72},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/journals/sLogica/GutierrezGMOV02.bib},
     doi = {10.1023/A:1020530109551},
     timestamp = {Tue, 29 Aug 2023 01:00:00 +0200},
     url = {https://doi.org/10.1023/A:1020530109551},
}

Bibliometric data

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

4

CITATIONS

4 Total citations

0 Recent citations

0.73 Field Citation Ratio

n/a Relative Citation Ratio

• Citations
• CrossRef - Citation Indexes: 4
• Scopus - Citation Indexes: 3

• Captures
• Mendeley - Readers: 7

-

see details

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. de Guzmán, M. Ojeda-Aciego, and A. Valverde. “Restricted Δ-Trees in Multiple-Valued Logics”. In: Artificial Intelligence: Methodology, Systems, and Applications. Springer Berlin Heidelberg, 2002, p. 223–232. ISBN: 9783540461487. DOI: 10.1007/3-540-46148-5_23. URL: http://dx.doi.org/10.1007/3-540-46148-5_23.

[2] I. P. de Guzmán, M. Ojeda-Aciego, and A. Valverde. “Restricted Δ-Trees and Reduction Theorems in Multiple-Valued Logics”. In: Advances in Artificial Intelligence — IBERAMIA 2002. Springer Berlin Heidelberg, 2002, p. 161–171. ISBN: 9783540361312. DOI: 10.1007/3-540-36131-6_17. URL: http://dx.doi.org/10.1007/3-540-36131-6_17.

[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.

[4] 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.