• A. Mordido. A probabilistic logic over equations and domain restrictions. PhD thesis, IST, Universidade de Lisboa, 2017. Supervised by C. Caleiro.
  Get a preprint: 17-M-PhDthesis.pdf 
• C. Caleiro, F. Casal, and A. Mordido. Classical generalized probabilistic satisfiability. In Proceedings of the 26th Intl. Joint Conf. on Artificial Intelligence (IJCAI 2017), in print.
  Get a preprint: 17-CCM-ijcai.pdf 
• A. Mordido and C. Caleiro. Probabilistic logic over equations and domain restrictions. Mathematical Structures in Computer Science, in print.
  Get a preprint: 15-MC-probeq.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 
• A. Mordido and C. Caleiro. An equation-based classical logic. In V. de Paiva, R. de Queiroz, L. Moss, D. Leivant, and A. Oliveira, editors, WoLLIC 2015, Selected Papers, volume 9160 of Lecture Notes in Computer Science, pages 38--52. Springer-Verlag, 2015.
  Get a preprint: 15-MC-eqbased.pdf