default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos Caleiro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Carlos Caleiro
, Sérgio Marcelino:
Modular Many-Valued Semantics for combined Logics. J. Symb. Log. 89(2): 583-636 (2024)- 2023
- [i9]Carlos Caleiro, Sérgio Marcelino, Umberto Rivieccio:
Some more theorems on structural entailment relations and non-deterministic semantics. CoRR abs/2310.02952 (2023) - 2022
- [j34]Hugo Albuquerque, Carlos Caleiro:
AN ABSTRACT ALGEBRAIC LOGIC STUDY OF DA COSTA'S LOGIC {\mathscr {C}}_1 AND SOME OF ITS PARACONSISTENT EXTENSIONS. Bull. Symb. Log. 28(4): 477-528 (2022) - [j33]Pedro Filipe, Sérgio Marcelino, Carlos Caleiro:
Computational properties of finite PNmatrices. J. Log. Comput. 32(8): 1694-1719 (2022) - [j32]João Saúde, Guilherme Ramos, Ludovico Boratto, Carlos Caleiro:
A Robust Reputation-Based Group Ranking System and Its Resistance to Bribery. ACM Trans. Knowl. Discov. Data 16(2): 26:1-26:35 (2022) - [c36]Sérgio Marcelino, Carlos Caleiro, Pedro Filipe:
Computational Properties of Partial Non-deterministic Matrices and Their Logics. LFCS 2022: 180-197 - [c35]Pedro Filipe, Carlos Caleiro, Sérgio Marcelino:
Monadicity of Non-deterministic Logical Matrices is Undecidable. NCL 2022: 55-67 - [i8]Carlos Caleiro, Sérgio Marcelino:
Modular many-valued semantics for combined logics. CoRR abs/2202.02189 (2022) - 2021
- [j31]Guilherme Ramos, Sérgio Pequito, Carlos Caleiro:
On the index of convergence of a class of Boolean matrices with structural properties. Int. J. Control 94(6): 1475-1483 (2021) - [j30]Sérgio Marcelino, Carlos Caleiro:
Axiomatizing non-deterministic many-valued generalized consequence relations. Synth. 198(22-S): 5373-5390 (2021) - [j29]Carolina Blasio, Carlos Caleiro, João Marcos:
What is a logical theory? On theories containing assertions and denials. Synth. 198(22-S): 5481-5504 (2021) - 2020
- [j28]Guilherme Ramos, Ludovico Boratto, Carlos Caleiro:
On the negative impact of social influence in recommender systems: A study of bribery in collaborative hybrid algorithms. Inf. Process. Manag. 57(2): 102058 (2020) - [c34]Guilherme Ramos, Carlos Caleiro:
A Novel Similarity Measure for Group Recommender Systems with Optimal Time Complexity. BIAS 2020: 95-109 - [c33]Carlos Caleiro, Sérgio Marcelino, Pedro Filipe:
Infectious semantics and analytic calculi for even more inclusion logics. ISMVL 2020: 224-229 - [i7]João Saúde, Guilherme Ramos, Ludovico Boratto, Carlos Caleiro:
A Robust Reputation-based Group Ranking System and its Resistance to Bribery. CoRR abs/2004.06223 (2020)
2010 – 2019
- 2019
- [j27]Andreia Mordido, Carlos Caleiro:
Probabilistic logic over equations and domain restrictions. Math. Struct. Comput. Sci. 29(6): 872-895 (2019) - [j26]Regivan H. N. Santiago, Benjamín R. C. Bedregal, João Marcos, Carlos Caleiro, Jocivania Pinheiro:
Semi-BCI Algebras. J. Multiple Valued Log. Soft Comput. 32(1-2): 87-109 (2019) - [j25]Carlos Caleiro, Sérgio Marcelino, João Marcos:
Combining fragments of classical logic: When are interaction principles needed? Soft Comput. 23(7): 2213-2231 (2019) - [j24]Carlos Caleiro, Filipe Casal, Andreia Mordido:
Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities. Theor. Comput. Sci. 781: 39-62 (2019) - [c32]Carlos Caleiro, Sérgio Marcelino:
Analytic Calculi for Monadic PNmatrices. WoLLIC 2019: 84-98 - 2018
- [j23]Carlos Caleiro, Sérgio Marcelino, Umberto Rivieccio:
Characterizing finite-valuedness. Fuzzy Sets Syst. 345: 113-125 (2018) - [c31]Guilherme Ramos, Sérgio Pequito, Carlos Caleiro:
The robust minimal controllability problem for switched linear continuous-time systems. ACC 2018: 210-215 - [i6]Regivan H. N. Santiago, Benjamín R. C. Bedregal, João Marcos, Carlos Caleiro, Jocivania Pinheiro:
Semi-BCI Algebras. CoRR abs/1803.04808 (2018) - [i5]Carlos Caleiro, Sérgio Marcelino, João Marcos:
Combining fragments of classical logic: When are interaction principles needed? CoRR abs/1810.05879 (2018) - 2017
- [j22]Sérgio Marcelino, Carlos Caleiro:
On the characterization of fibred logics, with applications to conservativity and finite-valuedness. J. Log. Comput. 27(7): 2063-2088 (2017) - [j21]Carlos Caleiro, Luca Viganò:
Compositional Meaning in Logic. Logica Universalis 11(3): 283-295 (2017) - [c30]Carlos Caleiro, Sérgio Marcelino, João Marcos:
Merging Fragments of Classical Logic. FroCoS 2017: 298-315 - [c29]João Saúde, Guilherme Ramos, Carlos Caleiro, Soummya Kar:
Reputation-Based Ranking Systems and Their Resistance to Bribery. ICDM 2017: 1063-1068 - [c28]Carlos Caleiro, Filipe Casal, Andreia Mordido:
Classical Generalized Probabilistic Satisfiability. IJCAI 2017: 908-914 - [c27]Sérgio Marcelino, Carlos Caleiro:
Disjoint Fibring of Non-deterministic Matrices. WoLLIC 2017: 242-255 - [i4]João Saúde, Guilherme Ramos, Carlos Caleiro, Soummya Kar:
Robust reputation-based ranking on multipartite rating networks. CoRR abs/1705.00947 (2017) - [i3]Carlos Caleiro, Sérgio Marcelino, João Marcos:
Merging fragments of classical logic. CoRR abs/1706.08689 (2017) - [i2]Guilherme Ramos, João Saúde, Carlos Caleiro, Soummya Kar:
Recommendation via matrix completion using Kolmogorov complexity. CoRR abs/1707.06055 (2017) - 2016
- [j20]Sérgio Marcelino, Carlos Caleiro:
Decidability and complexity of fibred logics without shared connectives. Log. J. IGPL 24(5): 673-707 (2016) - [c26]Carlos Caleiro, Filipe Casal, Andreia Mordido:
Generalized Probabilistic Satisfiability. LSFA 2016: 39-56 - 2015
- [j19]Carlos Caleiro, João Marcos, Marco Volpe:
Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics. Theor. Comput. Sci. 603: 84-110 (2015) - [c25]Andreia Mordido, Carlos Caleiro:
An Equation-Based Classical Logic. WoLLIC 2015: 38-52 - 2014
- [i1]Carlos Caleiro, João Marcos, Marco Volpe:
Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics. CoRR abs/1408.3775 (2014) - 2013
- [j18]Carlos Caleiro, Luca Viganò, Marco Volpe:
On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. Logica Universalis 7(1): 33-69 (2013) - [j17]Carlos Caleiro, Ricardo Gonçalves:
Abstract Valuation Semantics. Stud Logica 101(4): 677-712 (2013) - [c24]Bruno Conchinha, David A. Basin, Carlos Caleiro:
Symbolic Probabilistic Analysis of Off-Line Guessing. ESORICS 2013: 363-380 - [c23]Carlos Caleiro, Luca Viganò, Marco Volpe:
A Labeled Deduction System for the Logic UB. TIME 2013: 45-53 - 2012
- [j16]Carlos Caleiro, João Marcos:
Many-valuedness Meets Bivalence: Using Logical Values in an EffectiveWay. J. Multiple Valued Log. Soft Comput. 19(1-3): 51-70 (2012) - [c22]Marco Volpe, João Marcos, Carlos Caleiro:
Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics. WoLLIC 2012: 321-335 - 2011
- [j15]Carlos Caleiro, Ricardo Gonçalves:
Towards a Behavioral Algebraic Theory of Logical Valuations. Fundam. Informaticae 106(2-4): 191-209 (2011) - [j14]Carlos Caleiro, Paula Gouveia, Jaime Ramos:
Hierarchical logical consequence. Log. J. IGPL 19(4): 544-565 (2011) - [j13]David A. Basin, Carlos Caleiro, Jaime Ramos, Luca Viganò:
Distributed temporal logic for the analysis of security protocol models. Theor. Comput. Sci. 412(31): 4007-4043 (2011) - [c21]Bruno Conchinha, David A. Basin, Carlos Caleiro:
FAST: An Efficient Decision Procedure for Deduction and Static Equivalence. RTA 2011: 11-20 - 2010
- [c20]Bruno Conchinha, David A. Basin, Carlos Caleiro:
Efficient Decision Procedures for Message Deducibility and Static Equivalence. Formal Aspects in Security and Trust 2010: 34-49 - [c19]Carlos Caleiro, João Marcos:
Two Many Values: An Algorithmic Outlook on Suszko's Thesis. ISMVL 2010: 93-97
2000 – 2009
- 2009
- [j12]Carlos Caleiro, Ricardo Gonçalves:
Behavioral algebraization of da Costa's C-systems. J. Appl. Non Class. Logics 19(2): 127-148 (2009) - [j11]David A. Basin, Carlos Caleiro, Jaime Ramos, Luca Viganò:
Labelled Tableaux for Distributed Temporal Logic. J. Log. Comput. 19(6): 1245-1279 (2009) - [j10]Carlos Caleiro, Ricardo Gonçalves, Manuel A. Martins:
Behavioral Algebraization of Logics. Stud Logica 91(1): 63-111 (2009) - [c18]Carlos Caleiro, Ricardo Gonçalves:
Algebraic Valuations as Behavioral Logical Matrices. WoLLIC 2009: 13-25 - [c17]Carlos Caleiro, João Marcos:
Classic-Like Analytic Tableaux for Finite-Valued Logics. WoLLIC 2009: 268-280 - [c16]Bruno Montalto, Carlos Caleiro:
Modeling and Reasoning about an Attacker with Cryptanalytical Capabilities. QAPL 2009: 143-165 - 2008
- [c15]David A. Basin, Carlos Caleiro, Jaime Ramos, Luca Viganò:
A Labeled Tableaux Systemfor the Distributed Temporal Logic DTL. TIME 2008: 101-109 - 2007
- [j9]Carlos Caleiro, Jaime Ramos:
From Fibring to Cryptofibring. A Solution to the Collapsing Problem. Logica Universalis 1(1): 71-92 (2007) - [c14]Carlos Caleiro, Jaime Ramos:
Combining Classical and Intuitionistic Implications. FroCoS 2007: 118-132 - 2006
- [j8]Carlos Caleiro, Luca Viganò, David A. Basin:
On the semantics of Alice&Bob specifications of security protocols. Theor. Comput. Sci. 367(1-2): 88-122 (2006) - [c13]Carlos Caleiro, Paulo Mateus, Amílcar Sernadas, Cristina Sernadas:
Quantum Institutions. Essays Dedicated to Joseph A. Goguen 2006: 50-64 - [c12]Carlos Caleiro, Ricardo Gonçalves:
On the Algebraization of Many-Sorted Logics. WADT 2006: 21-36 - 2005
- [j7]Carlos Caleiro, Luca Viganò, David A. Basin:
Relating Strand Spaces and Distributed Temporal Logic for Security Protocol Analysis. Log. J. IGPL 13(6): 637-663 (2005) - [c11]Carlos Caleiro, Amílcar Sernadas, Cristina Sernadas:
Fibring Logics: Past, Present and Future. We Will Show Them! (1) 2005: 363-388 - [c10]Carlos Caleiro, Luca Viganò, David A. Basin:
Deconstructing Alice and Bob. ARSPA@ICALP 2005: 3-22 - 2004
- [c9]Carlos Caleiro, Jaime Ramos:
Cryptomorphisms at Work. WADT 2004: 45-60 - [c8]Carlos Caleiro, Luca Viganò, David A. Basin:
Metareasoning about Security Protocols using Distributed Temporal Logic. ARSPA@IJCAR 2004: 67-89 - 2003
- [j6]Carlos Caleiro, Walter Alexandre Carnielli, Marcelo E. Coniglio, Amílcar Sernadas, Cristina Sernadas:
Fibring Non-Truth-Functional Logics: Completeness Preservation. J. Log. Lang. Inf. 12(2): 183-211 (2003) - 2002
- [c7]Carlos Caleiro, Paula Gouveia, Jaime Ramos:
Completeness Results for Fibred Parchments: Beyond the Propositional Base. WADT 2002: 185-200 - 2001
- [c6]Carlos Caleiro, Paulo Mateus, Jaime Ramos, Amílcar Sernadas:
Combining Logics: Parchments Revisited. WADT 2001: 48-70 - 2000
- [j5]Hans-Dieter Ehrich, Carlos Caleiro:
Specifying Communication in Distributed Information Systems. Acta Informatica 36(8): 591-616 (2000)
1990 – 1999
- 1999
- [j4]Amílcar Sernadas, Cristina Sernadas, Carlos Caleiro:
Fibring of Logics as a Categorial Construction. J. Log. Comput. 9(2): 149-179 (1999) - 1998
- [j3]Amílcar Sernadas, Cristina Sernadas, Carlos Caleiro:
Denotational Semantics of Object Specification. Acta Informatica 35(9): 729-773 (1998) - [c5]Hans-Dieter Ehrich, Carlos Caleiro, Amílcar Sernadas, Grit Denker:
Logics for Specifying Concurrent Information Systems. Logics for Databases and Information Systems 1998: 167-198 - [c4]Amílcar Sernadas, Cristina Sernadas, Carlos Caleiro, Till Mossakowski:
Categorial Fibring of Logics with Terms and Binding Operators. FroCoS 1998: 295-316 - [c3]Carlos Caleiro, Cristina Sernadas, Amílcar Sernadas:
Parameterisation of Logics. WADT 1998: 48-62 - 1997
- [j2]Amílcar Sernadas, Cristina Sernadas, Carlos Caleiro:
Synchronization of Logics. Stud Logica 59(1): 217-247 (1997) - [c2]Grit Denker, Jaime Ramos, Carlos Caleiro, Amílcar Sernadas:
A Linear Temporal Logic Approach to Objects with Transactions. AMAST 1997: 170-184 - [c1]Amílcar Sernadas, Cristina Sernadas, Carlos Caleiro:
Synchronization of Logics with Mixed Rules: Completeness Preservation. AMAST 1997: 465-478 - 1996
- [j1]Carlos Caleiro, Gunter Saake, Amílcar Sernadas:
Deriving Liveness Goals from Temporal Logic Specifications. J. Symb. Comput. 22(5/6): 521-553 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
