tascpl: {TAS} Solver for Classical Propositional Logic
Abstract
Citation
Please, cite this work as:
[OA04] M. Ojeda-Aciego and Agust'. “tascpl: TAS Solver for Classical Propositional Logic”. In: Logics in Artificial Intelligence, 9th European Conference, JELIA 2004, Lisbon, Portugal, September 27-30, 2004, Proceedings. Ed. by J. J. Alferes and J. A. Leite. Vol. 3229. Lecture Notes in Computer Science. Springer, 2004, pp. 738-741. DOI: 10.1007/978-3-540-30227-8_70. URL: https://doi.org/10.1007/978-3-540-30227-8_70.
Papers citing this work
The following is a non-exhaustive list of papers that cite this work:
[1] P. Inverardi, P. Pelliccione, and M. Tivoli. “Towards an assume-guarantee theory for adaptable systems”. In: 2009 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems. IEEE, May. 2009, p. 106–115. DOI: 10.1109/seams.2009.5069079. URL: http://dx.doi.org/10.1109/seams.2009.5069079.