Abstract
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified Δ-tree representation of formulas in negation normal form. This new representation allows for a better description of the reduction strategies, in that considers only those occurrences of literals which are relevant for the satisfiability of the input formula. These reduction strategies are aimed at decreasing the number of required branchings and, therefore, control the size of the search space for the SAT problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aguilera, G., de Guzmán, I.P., Ojeda-Aciego, M., Valverde, A.: Reductions for non-clausal theorem proving. Theoretical Computer Science 266(1/2), 81–112 (2001)
de Guzmán, I.P., Ojeda-Aciego, M., Valverde, A.: Implicates and reduction techniques for temporal logics. Annals of Mathematics and Artificial Intelligence 27, 2–23 (1999)
de Guzmán, I.P., Ojeda-Aciego, M., Valverde, A.: Restricted Δ-trees and reduction theorems in multiple-valued logics. In: Garijo, F.J., Riquelme, J.-C., Toro, M. (eds.) IBERAMIA 2002. LNCS (LNAI), vol. 2527, pp. 161–171. Springer, Heidelberg (2002)
Giunchiglia, E., Maratea, M., Tacchella, A., Zambonin, D.: Evaluating search heuristics and optimization techniques in propositional satisfiability. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 341–363. Springer, Heidelberg (2001)
Groote, J.F., Warners, J.P.: The propositional formula checker HeerHugo. In: Gent, I., van Maaren, H., Walsh, T. (eds.) SAT2000: Highlights of Satisfiability Research in the year 2000. Frontiers in Artificial Intelligence and Applications, pp. 261–281. Kluwer Academic, Dordrecht (2000)
Gutiérrez, G., de Guzmán, I.P., Martínez, J., Ojeda-Aciego, M., Valverde, A.: Satisfiability testing for Boolean formulas using Δ-trees. Studia Logica 72, 33–60 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ojeda-Aciego, M., Valverde, A. (2004). tascpl: TAS Solver for Classical Propositional Logic. In: Alferes, J.J., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2004. Lecture Notes in Computer Science(), vol 3229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30227-8_70
Download citation
DOI: https://doi.org/10.1007/978-3-540-30227-8_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23242-1
Online ISBN: 978-3-540-30227-8
eBook Packages: Springer Book Archive