• C. Caleiro, S. Marcelino, and J. Marcos. Combining fragments of classical logic: When are interaction principles needed? Soft Computing, in print.
    Get a preprint: 18-CMM-classicalinteractions.pdf 
  • C. Caleiro, F. Casal, and A. Mordido. Generalized probabilistic satisfiability. Electronic Notes in Theoretical Computer Science, 332:39--56, 2017.
    Get a preprint: 16-CCM-genpsat.pdf 
  • C. Caleiro and A. Souto. Cybersecurity and obscurantism (in portuguese). Cyberlaw, 1:71--89, 2016.
    Get a preprint: 16-CS-cyberlaw.pdf 
  • C. Blasio, C. Caleiro, and J. Marcos. On B-entailment. In Abstracts of Logic Colloquium 2013. Bulletin of Symbolic Logic 20(2), 2014.
    Get a preprint: 14-BCM-bent.pdf 
  • C. Caleiro and J. Ramos. Classical and intuitionistic propositional logic. In Abstracts of Logic Colloquium 2013. Bulletin of Symbolic Logic 20(2), 2014.
    Get a preprint: 14-CR-cipl.pdf 
  • S. Marcelino, C. Caleiro, and P. Baltazar. Conservativeness and decidability of fibred logics. In Abstracts of Logic Colloquium 2013. Bulletin of Symbolic Logic 20(2), 2014.
    Get a preprint: 14-MCB-lcol.pdf 
  • X. Zou, D. Qiu, F. Yu, and P. Mateus. Security problems in the quantum signature scheme with a weak arbitrator. International Journal of Theoretical Physics, 53:603--611, 2014.
    Get a preprint: 13-ZQYM-SecAttackQS.pdf 
  • L. Li, D. Qiu, and P. Mateus. Quantum secret sharing with classical Bobs. Journal of Physics A: Mathematical and Theoretical, 46(4):045304, 2013.
    Get a preprint: 12-LQM-SSCB.pdf 
  • X. Zou, D. Qiu, and P. Mateus. Security analyses and improvement of arbitrated quantum signature with an untrusted arbitrator. International Journal of Theoretical Physics, 52:3295--3305, 2013.
    Get a preprint: 13-ZQM-SAQS.pdf 
  • P. Mateus, D. Qiu, and L. Li. On the complexity of minimizing probabilistic and quantum automata. Information and Computation, 218:36--53, 2012.
    Get a preprint: 12-MQL-cminpqa.pdf 
  • D. Basin, C. Caleiro, J. Ramos, and L. Viganò. Distributed temporal logic for the analysis of security protocol models. Theoretical Computer Science, 412(31):4007--4043, 2011.
    Get a preprint: 10-BCRV-dtl4spa.pdf 
  • P. Mateus, J. Ramos, A. Sernadas, and C. Sernadas. Temporal logics for reasoning about quantum systems. In I. Mackie and S. Gay, editors, Semantic Techniques in Quantum Computation, pages 389--413. Cambridge University Press, 2010.
    Get a preprint: 08-MRSS-qsec11.pdf 
  • P. Baltazar and P. Mateus. Temporalization of probabilistic propositional logic. In S. Artemov and A. Nerode, editors, Logic Foundations of Computer Science 2009, volume 5407 of Lecture Notes in Computer Science, pages 46--60. Springer, 2009.
    Get a preprint: 08-BM-qsec09s.pdf 
  • P. Baltazar, R. Chadha, and P. Mateus. Quantum computation tree logic -- model checking and complete calculus. International Journal of Quantum Information, 6(2):219--236, 2008.
    Get a preprint: 08-BCM-qsec10.pdf 
  • D. Basin, C. Caleiro, J. Ramos, and L. Viganò. A labeled tableaux for the distributed temporal logic DTL. In Proceedings of the 15th Intl.Symp. on Temporal Representation and Reasoning (TIME 2008), pages 101--109. IEEE Computer Society Press, 2008.
    Get a preprint: 07-BCRV-dtl-tableaux.pdf 
  • J. Bouda, P. Mateus, N. Paunkovic, and J. Rasga. On the power of quantum tamper-proof devices. International Journal of Quantum Information, 6(2):281--302, 2008.
    Get a preprint: 08-BMNR-qsec02a.pdf 
  • P. Baltazar, R. Chadha, P. Mateus, and A. Sernadas. Towards model-checking quantum security protocols. In P. Dini et al, editor, Proceedings of the First Workshop on Quantum Security: QSec'07, page 0014. IEEE Press, 2007. Joint e-proceedings with Quantum, Nano, and Micro Technologies: ICQNM '07. 6 pages.
    Get a preprint: 06-BCMS-quantlog13s.pdf 
  • P. Baltazar, P. Mateus, R. Nagarajan, and N. Papanikolaou. Exogenous probabilistic computation tree logic. Electronic Notes in Theoretical Computer Science, 190(3):95--110, 2007.
    Get a preprint: 07-BMNP-quantlog15s.pdf 
  • R. Chadha, L. Cruz-Filipe, P. Mateus, and A. Sernadas. Reasoning about probabilistic sequential programs. Theoretical Computer Science, 379(1-2):142--165, 2007.
    Get a preprint: 06-CCMS-quantlog08.pdf 
  • P. Mateus, F. Moura, and J. Rasga. Transferring proofs of zero-knowledge systems with quantum correlations. In P. Dini et al, editor, Proceedings of the First Workshop on Quantum Security: QSec'07, page 0009. IEEE Press, 2007. Joint e-proceedings with Quantum, Nano, and Micro Technologies: ICQNM '07. 6 pages.
    Get a preprint: 06-MMR-quantlog14s.pdf 
  • A. Sernadas, P. Mateus, and Y. Omar. Quantum computation and information. In M. S. Pereira, editor, A Portrait of State-of-the-Art Research at the Technical University of Lisbon, pages 46--65. Springer, 2007.
    Get a preprint: 06-SMO-quantlog09.pdf 
  • C. Caleiro, P. Mateus, A. Sernadas, and C. Sernadas. Quantum institutions. In K. Futatsugi, J.-P. Jouannaud, and J. Meseguer, editors, Algebra, Meaning, and Computation -- Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday, volume 4060 of Lecture Notes in Computer Science, pages 50--64. Springer, 2006.
    Get a preprint: 05-CMSS-quantlog06.pdf 
  • R. Chadha, P. Mateus, and A. Sernadas. Reasoning about quantum imperative programs. Electronic Notes in Theoretical Computer Science, 158:19--40, 2006. Invited talk at the Twenty-second Conference on the Mathematical Foundations of Programming Semantics, May 24-27, 2006, Genova.
    Get a preprint: 06-CMS-quantlog10s.pdf 
  • R. Chadha, P. Mateus, and A. Sernadas. Reasoning about states of probabilistic sequential programs. In Z. Ésik, editor, Computer Science Logic 2006 (CSL06), volume 4207 of Lecture Notes in Computer Science, pages 240--255. Springer, 2006.
    Get a preprint: 06-CMS-quantlog08s.pdf 
  • P. Mateus and A. Sernadas. Weakly complete axiomatization of exogenous quantum propositional logic. Information and Computation, 204(5):771--794, 2006. ArXiv math.LO/0503453.
    Get a preprint: 05-MS-quantlog01.pdf 
  • C. Caleiro, L. Viganò, and D. Basin. Deconstructing Alice and Bob. Electronic Notes in Theoretical Computer Science, 135(1):3--22, 2005. Preliminary version presented at ICALP'05 ARSPA Workshop.
    Get a preprint: 05-CVB-alice&bob.pdf 
  • C. Caleiro, L. Viganò, and D. Basin. Metareasoning about security protocols using distributed temporal logic. Electronic Notes in Theoretical Computer Science, 125(1):67--89, 2005. Preliminary version presented at IJCAR'04 ARSPA Workshop.
    Get a preprint: 04-CVB-fiblog15s2.pdf 
  • P. Mateus, A. Sernadas, and C. Sernadas. Exogenous semantics approach to enriching logics. In G. Sica, editor, Essays on the Foundations of Mathematics and Logic, volume 1, pages 165--194. Polimetrica, 2005.
    Get a preprint: 05-MSS-quantlog03.pdf 
  • P. Gouveia and J. Ramos. Multi-agent systems specification and certification: A situation and state calculus approach. Annals of Mathematics and Artificial Intelligence, 41(2-4):301--338, 2004.
    Get a preprint: 03-GR-ssccert.ps  03-GR-ssccert.pdf 
  • P. Mateus and A. Sernadas. Reasoning about quantum systems. In J. Alferes and J. Leite, editors, Logics in Artificial Intelligence, Ninth European Conference, JELIA'04, volume 3229 of Lecture Notes in Artificial Intelligence, pages 239--251. Springer, 2004.
    Get a preprint: 04-MS-fiblog24x.ps  04-MS-fiblog24x.pdf 
  • A. Sernadas, J. Ramos, and P. Mateus. Linear algebra techniques for deciding the correctness of probabilistic programs with bounded resources. Technical report, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2008. Short paper presented at LPAR 2008, Doha, Qatar. November 22-27.
    Get a preprint: 08-SRM-lap01tiny.pdf 
  • P. Mateus and A. Sernadas. Complete exogenous quantum propositional logic. Technical report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2005. Extended abstract. Short presentation at LICS 2005, Chicago, USA, June 26-29.
    Get a preprint: 05-MS-quantlog01sp.pdf