Deriving Liveness Goals from Temporal Logic Specifications. - Carlos Caleiro; Gunter Saake; Amílcar Sernadas (J. Symb. Comput., 1996)

A Linear Temporal Logic Approach to Objects with Transactions. - Grit Denker; Jaime Ramos; Carlos Caleiro; Amílcar Sernadas (AMAST, 1997)

Synchronization of Logics with Mixed Rules: Completeness Preservation. - Amílcar Sernadas; Cristina Sernadas; Carlos Caleiro (AMAST, 1997)

Synchronization of Logics. - Amílcar Sernadas; Cristina Sernadas; Carlos Caleiro (Stud Logica, 1997)

Logics for Specifying Concurrent Information Systems. - Hans-Dieter Ehrich; Carlos Caleiro; Amílcar Sernadas; Grit Denker (Logics for Databases and Information Systems, 1998)

Categorial Fibring of Logics with Terms and Binding Operators. - Amílcar Sernadas; Cristina Sernadas; Carlos Caleiro; Till Mossakowski (FroCoS, 1998)

Parameterisation of Logics. - Carlos Caleiro; Cristina Sernadas; Amílcar Sernadas (WADT, 1998)

Denotational Semantics of Object Specification. - Amílcar Sernadas; Cristina Sernadas; Carlos Caleiro (Acta Informatica, 1998)

Fibring of Logics as a Categorial Construction. - Amílcar Sernadas; Cristina Sernadas; Carlos Caleiro (J. Log. Comput., 1999)

Specifying Communication in Distributed Information Systems. - Hans-Dieter Ehrich; Carlos Caleiro (Acta Informatica, 2000)

Combining Logics: Parchments Revisited. - Carlos Caleiro; Paulo Mateus; Jaime Ramos; Amílcar Sernadas (WADT, 2001)

Completeness Results for Fibred Parchments: Beyond the Propositional Base. - Carlos Caleiro; Paula Gouveia; Jaime Ramos (WADT, 2002)

Fibring Non-Truth-Functional Logics: Completeness Preservation. - Carlos Caleiro; Walter Alexandre Carnielli; Marcelo E. Coniglio; Amílcar Sernadas; Cristina Sernadas (J. Log. Lang. Inf., 2003)

Cryptomorphisms at Work. - Carlos Caleiro; Jaime Ramos (WADT, 2004)

Metareasoning about Security Protocols using Distributed Temporal Logic. - Carlos Caleiro; Luca Viganò 001; David A. Basin (ARSPA@IJCAR, 2004)

Fibring Logics: Past, Present and Future. - Carlos Caleiro; Amílcar Sernadas; Cristina Sernadas (We Will Show Them! (1), 2005)

Deconstructing Alice and Bob. - Carlos Caleiro; Luca Viganò 001; David A. Basin (ARSPA@ICALP, 2005)

Relating Strand Spaces and Distributed Temporal Logic for Security Protocol Analysis. - Carlos Caleiro; Luca Viganò 001; David A. Basin (Log. J. IGPL, 2005)

Quantum Institutions. - Carlos Caleiro; Paulo Mateus; Amílcar Sernadas; Cristina Sernadas (Essays Dedicated to Joseph A. Goguen, 2006)

On the Algebraization of Many-Sorted Logics. - Carlos Caleiro; Ricardo Gonçalves 001 (WADT, 2006)

On the semantics of Alice&Bob specifications of security protocols. - Carlos Caleiro; Luca Viganò 001; David A. Basin (Theor. Comput. Sci., 2006)

Combining Classical and Intuitionistic Implications. - Carlos Caleiro; Jaime Ramos (FroCoS, 2007)

From Fibring to Cryptofibring. A Solution to the Collapsing Problem. - Carlos Caleiro; Jaime Ramos (Logica Universalis, 2007)

A Labeled Tableaux Systemfor the Distributed Temporal Logic DTL. - David A. Basin; Carlos Caleiro; Jaime Ramos; Luca Viganò 001 (TIME, 2008)

Algebraic Valuations as Behavioral Logical Matrices. - Carlos Caleiro; Ricardo Gonçalves 001 (WoLLIC, 2009)

Classic-Like Analytic Tableaux for Finite-Valued Logics. - Carlos Caleiro; João Marcos 001 (WoLLIC, 2009)

Modeling and Reasoning about an Attacker with Cryptanalytical Capabilities. - Bruno Montalto; Carlos Caleiro (QAPL, 2009)

Behavioral algebraization of da Costa's C-systems. - Carlos Caleiro; Ricardo Gonçalves 001 (J. Appl. Non Class. Logics, 2009)

Labelled Tableaux for Distributed Temporal Logic. - David A. Basin; Carlos Caleiro; Jaime Ramos; Luca Viganò 001 (J. Log. Comput., 2009)

Behavioral Algebraization of Logics. - Carlos Caleiro; Ricardo Gonçalves 001; Manuel A. Martins 001 (Stud Logica, 2009)

Efficient Decision Procedures for Message Deducibility and Static Equivalence. - Bruno Conchinha; David A. Basin; Carlos Caleiro (Formal Aspects in Security and Trust, 2010)

Two Many Values: An Algorithmic Outlook on Suszko's Thesis. - Carlos Caleiro; João Marcos 001 (ISMVL, 2010)

FAST: An Efficient Decision Procedure for Deduction and Static Equivalence. - Bruno Conchinha; David A. Basin; Carlos Caleiro (RTA, 2011)

Towards a Behavioral Algebraic Theory of Logical Valuations. - Carlos Caleiro; Ricardo Gonçalves 001 (Fundam. Informaticae, 2011)

Hierarchical logical consequence. - Carlos Caleiro; Paula Gouveia; Jaime Ramos (Log. J. IGPL, 2011)

Distributed temporal logic for the analysis of security protocol models. - David A. Basin; Carlos Caleiro; Jaime Ramos; Luca Viganò 001 (Theor. Comput. Sci., 2011)

Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics. - Marco Volpe 001; João Marcos 001; Carlos Caleiro (WoLLIC, 2012)

Many-valuedness Meets Bivalence: Using Logical Values in an EffectiveWay. - Carlos Caleiro; João Marcos 001 (J. Multiple Valued Log. Soft Comput., 2012)

Symbolic Probabilistic Analysis of Off-Line Guessing. - Bruno Conchinha; David A. Basin; Carlos Caleiro (ESORICS, 2013)

A Labeled Deduction System for the Logic UB. - Carlos Caleiro; Luca Viganò 001; Marco Volpe 001 (TIME, 2013)

On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. - Carlos Caleiro; Luca Viganò 001; Marco Volpe 001 (Logica Universalis, 2013)

Abstract Valuation Semantics. - Carlos Caleiro; Ricardo Gonçalves 001 (Stud Logica, 2013)

An Equation-Based Classical Logic. - Andreia Mordido; Carlos Caleiro (WoLLIC, 2015)

Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics. - Carlos Caleiro; João Marcos 001; Marco Volpe 001 (Theor. Comput. Sci., 2015)

Generalized Probabilistic Satisfiability. - Carlos Caleiro; Filipe Casal; Andreia Mordido (LSFA, 2016)

Decidability and complexity of fibred logics without shared connectives. - Sérgio Marcelino; Carlos Caleiro (Log. J. IGPL, 2016)

Merging Fragments of Classical Logic. - Carlos Caleiro; Sérgio Marcelino; João Marcos 001 (FroCoS, 2017)

Reputation-Based Ranking Systems and Their Resistance to Bribery. - João Saúde; Guilherme Ramos; Carlos Caleiro; Soummya Kar (ICDM, 2017)

Classical Generalized Probabilistic Satisfiability. - Carlos Caleiro; Filipe Casal; Andreia Mordido (IJCAI, 2017)

Disjoint Fibring of Non-deterministic Matrices. - Sérgio Marcelino; Carlos Caleiro (WoLLIC, 2017)

Recommendation via matrix completion using Kolmogorov complexity. - Guilherme Ramos; João Saúde; Carlos Caleiro; Soummya Kar (CoRR, 2017)

Robust reputation-based ranking on multipartite rating networks. - João Saúde; Guilherme Ramos; Carlos Caleiro; Soummya Kar (CoRR, 2017)

On the characterization of fibred logics, with applications to conservativity and finite-valuedness. - Sérgio Marcelino; Carlos Caleiro (J. Log. Comput., 2017)

Compositional Meaning in Logic. - Carlos Caleiro; Luca Viganò 001 (Logica Universalis, 2017)

The robust minimal controllability problem for switched linear continuous-time systems. - Guilherme Ramos; Sérgio Pequito; Carlos Caleiro (ACC, 2018)

Characterizing finite-valuedness. - Carlos Caleiro; Sérgio Marcelino; Umberto Rivieccio (Fuzzy Sets Syst., 2018)

Analytic Calculi for Monadic PNmatrices. - Carlos Caleiro; Sérgio Marcelino (WoLLIC, 2019)

Probabilistic logic over equations and domain restrictions. - Andreia Mordido; Carlos Caleiro (Math. Struct. Comput. Sci., 2019)

Semi-BCI Algebras. - Regivan H. N. Santiago; Benjamín R. C. Bedregal; João Marcos 001; Carlos Caleiro; Jocivania Pinheiro (J. Multiple Valued Log. Soft Comput., 2019)

Combining fragments of classical logic: When are interaction principles needed? - Carlos Caleiro; Sérgio Marcelino; João Marcos 001 (Soft Comput., 2019)

Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities. - Carlos Caleiro; Filipe Casal; Andreia Mordido (Theor. Comput. Sci., 2019)

A Novel Similarity Measure for Group Recommender Systems with Optimal Time Complexity. - Guilherme Ramos; Carlos Caleiro (BIAS, 2020)

Infectious semantics and analytic calculi for even more inclusion logics. - Carlos Caleiro; Sérgio Marcelino; Pedro Filipe (ISMVL, 2020)

On the negative impact of social influence in recommender systems: A study of bribery in collaborative hybrid algorithms. - Guilherme Ramos; Ludovico Boratto; Carlos Caleiro (Inf. Process. Manag., 2020)

On the index of convergence of a class of Boolean matrices with structural properties. - Guilherme Ramos; Sérgio Pequito; Carlos Caleiro (Int. J. Control, 2021)

What is a logical theory? On theories containing assertions and denials. - Carolina Blasio; Carlos Caleiro; João Marcos 001 (Synth., 2021)

Axiomatizing non-deterministic many-valued generalized consequence relations. - Sérgio Marcelino; Carlos Caleiro (Synth., 2021)

Computational Properties of Partial Non-deterministic Matrices and Their Logics. - Sérgio Marcelino; Carlos Caleiro; Pedro Filipe (LFCS, 2022)

Monadicity of Non-deterministic Logical Matrices is Undecidable. - Pedro Filipe; Carlos Caleiro; Sérgio Marcelino (NCL, 2022)

Computational properties of finite PNmatrices. - Pedro Filipe; Sérgio Marcelino; Carlos Caleiro (J. Log. Comput., 2022)

A Robust Reputation-Based Group Ranking System and Its Resistance to Bribery. - João Saúde; Guilherme Ramos; Ludovico Boratto; Carlos Caleiro (ACM Trans. Knowl. Discov. Data, 2022)

AN ABSTRACT ALGEBRAIC LOGIC STUDY OF DA COSTA'S LOGIC { mathscr {C}}_1 AND SOME OF ITS PARACONSISTENT EXTENSIONS. - Hugo Albuquerque; Carlos Caleiro (Bull. Symb. Log., 2022)

Some more theorems on structural entailment relations and non-deterministic semantics. - Carlos Caleiro; Sérgio Marcelino; Umberto Rivieccio (CoRR, 2023)

Equivalence of finite non-deterministic logical matrices is undecidable. - Carlos Caleiro; Pedro Filipe; Sérgio Marcelino (CoRR, 2024)

Modular Many-Valued Semantics for combined Logics. - Carlos Caleiro; Sérgio Marcelino (J. Symb. Log., 2024)

An Infinite Family of Finite-Valued Paraconsistent Algebraizable Logics. - Hugo Albuquerque; Carlos Caleiro (Stud Logica, 2025)