Claudia Carapelle

Orcid: 0000-0001-5981-7515

According to our database1, Claudia Carapelle authored at least 11 papers between 2013 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability.
ACM Trans. Comput. Log., 2020

2017
Satisfiability of ECTL∗ with Local Tree Constraints.
Theory Comput. Syst., 2017

2016
Satisfiability of ECTL<sup>⁎</sup> with constraints.
J. Comput. Syst. Sci., 2016

Description Logics Reasoning w.r.t. General TBoxes Is Decidable for Concrete Domains with the EHD-Property.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015
On the Satisfiability of Temporal Logics with Concrete Domains
PhD thesis, 2015

Satisfiability of ECTL* with Tree Constraints.
Proceedings of the Computer Science - Theory and Applications, 2015

Temporal Logics with Local Constraints (Invited Talk).
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Satisfiability for MTL and TPTL over Non-monotonic Data Words.
Proceedings of the Language and Automata Theory and Applications, 2014

User-definable Concrete Domains.
Proceedings of the 8th Joint Workshop of the German Research Training Groups in Computer Science, 2014

2013
Satisfiability of CTL* with Constraints.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013


  Loading...