Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Christophe Moy
Qiang Fu
Claudia Calabrese
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Wei Zhong
Radu Timofte
Kuanrui Yin
Home
/
Author
/
CARLOS CALEIRO
Author Info
Open Visualization
Name
Affiliation
Papers
CARLOS CALEIRO
IST Univ Lisboa, Dept Math, SQIG Inst Telecomunicacoes, Lisbon, Portugal
11
Collaborators
Citations
PageRank
12
14
4.23
Referers
Referees
References
15
152
108
Search Limit
100
152
Publications (11 rows)
Collaborators (12 rows)
Referers (15 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
0
0.34
2019
The robust minimal controllability problem for switched linear continuous-time systems
0
0.34
2018
On the characterization of fibred logics, with applications to conservativity and finite-valuedness.
3
0.47
2017
Recommendation via matrix completion using Kolmogorov complexity.
0
0.34
2017
Compositional Meaning in Logic.
0
0.34
2017
Merging fragments of classical logic.
2
0.41
2017
Classical Generalized Probabilistic Satisfiability.
0
0.34
2017
Disjoint Fibring of Non-deterministic Matrices.
1
0.37
2017
Decidability and complexity of fibred logics without shared connectives.
2
0.43
2016
An Equation-Based Classical Logic
1
0.37
2015
Completeness Results for Fibred Parchments: Beyond the Propositional Base
5
0.48
2002
1