Implicates and reduction techniques for temporal logics

uncategorised
Authors
Published

1 January 1999

Publication details

Ann. Math. Artif. Intell. vol. 27 (1-4), pages 3–23.

Links

DOI

 

Abstract

Citation

Please, cite this work as:

[GOA99] I. P. de Guzmán, M. Ojeda-Aciego, and Agust'. “Implicates and reduction techniques for temporal logics”. In: Ann. Math. Artif. Intell. 27.1-4 (1999), pp. 3-23. DOI: 10.1023/A:1018923315631. URL: https://doi.org/10.1023/A:1018923315631.

@Article{Guzman1999a,
     author = {Inman P. {de Guzm{’a}n} and Manuel Ojeda-Aciego and Agust'Valverde},
     journal = {Ann. Math. Artif. Intell.},
     title = {Implicates and reduction techniques for temporal logics},
     year = {1999},
     number = {1-4},
     pages = {3–23},
     volume = {27},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/journals/amai/GuzmanOV99.bib},
     doi = {10.1023/A:1018923315631},
     timestamp = {Sun, 28 May 2017 01:00:00 +0200},
     url = {https://doi.org/10.1023/A:1018923315631},
}

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] G. Gutiérrez, I. P. de Guzmán, J. Martínez, et al. “Reduction Theorems for Boolean Formulas Using Δ-Trees”. In: Logics in Artificial Intelligence. Springer Berlin Heidelberg, 2000, p. 179–192. ISBN: 9783540400066. DOI: 10.1007/3-540-40006-0_13. URL: http://dx.doi.org/10.1007/3-540-40006-0_13.

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