Satisfiability of CTL* with Constraints. - Claudia Carapelle; Alexander Kartzow; Markus Lohrey (CONCUR, 2013)

User-definable Concrete Domains. - Claudia Carapelle (Joint Workshop of the German Research Training Groups in Computer Science, 2014)

Satisfiability for MTL and TPTL over Non-monotonic Data Words. - Claudia Carapelle; Shiguang Feng; Oliver Fernandez Gil; Karin Quaas (LATA, 2014)

Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words. - Claudia Carapelle; Shiguang Feng; Oliver Fernandez Gil; Karin Quaas (AFL, 2014)

Temporal Logics with Local Constraints (Invited Talk). - Claudia Carapelle; Markus Lohrey (CSL, 2015)

Satisfiability of ECTL* with Tree Constraints. - Claudia Carapelle; Shiguang Feng; Alexander Kartzow; Markus Lohrey (CSR, 2015)

On the Satisfiability of Temporal Logics with Concrete Domains - Claudia Carapelle (2015)

Description Logics Reasoning w.r.t. General TBoxes Is Decidable for Concrete Domains with the EHD-Property. - Claudia Carapelle; Anni-Yasmin Turhan (ECAI, 2016)

Satisfiability of ECTL⁎ with constraints. - Claudia Carapelle; Alexander Kartzow; Markus Lohrey (J. Comput. Syst. Sci., 2016)

Satisfiability of ECTL∗ with Local Tree Constraints. - Claudia Carapelle; Shiguang Feng; Alexander Kartzow; Markus Lohrey (Theory Comput. Syst., 2017)

MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability. - Shiguang Feng; Claudia Carapelle; Oliver Fernández Gil; Karin Quaas (ACM Trans. Comput. Log., 2020)