International Center for Computational Logic - Benutzerbeiträge [de]

Inproceedings3090

2016-06-14T14:10:29Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Anni-Yasmin Turhan;
}}
{{Inproceedings
|Referiert=1
|Title=Description Logics Reasoning w.r.t. General TBoxes is decidable for Concrete Domains with the EHD-property
|To appear=1
|Year=2016
|Month=September
|Booktitle=Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016)
}}
{{Publikation Details
|Abstract=Reasoning for Description Logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate a concrete domain D into the well known description logic ALC, we call the resulting logic ALCP(D).
We then identify sufficient conditions on D that guarantee decidability of the satisfiability problem, even in the presence of general TBoxes. In particular, we show decidability of ALCP(D) for several domains over the integers, for which decidability was open. More generally, this result holds for all negation-closed concrete domains with the EHD-property, which stands for `the existence of a homomorphism is definable'. Such technique has recently been used to show decidability of CTL* with local constraints over the integers.
|Projekt=HAEC B02
|Forschungsgruppe=Automatentheorie
}}

Inproceedings3090

2016-06-14T14:09:13Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Anni-Yasmin Turhan;
}}
{{Inproceedings
|Referiert=1
|Title=Description Logics Reasoning w.r.t. General TBoxes is decidable for Concrete Domains with the EHD-property.
|To appear=1
|Year=2016
|Month=September
|Booktitle=Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016)
}}
{{Publikation Details
|Abstract=Reasoning for Description Logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate a concrete domain D into the well known description logic ALC, we call the resulting logic ALCP(D).
We then identify sufficient conditions on D that guarantee decidability of the satisfiability problem, even in the presence of general TBoxes. In particular, we show decidability of ALCP(D) for several domains over the integers, for which decidability was open. More generally, this result holds for all negation-closed concrete domains with the EHD-property, which stands for `the existence of a homomorphism is definable'. Such technique has recently been used to show decidability of CTL* with local constraints over the integers.
|Projekt=HAEC B02
|Forschungsgruppe=Automatentheorie
}}

Inproceedings3090

2016-06-14T14:08:21Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Anni-Yasmin Turhan;
}}
{{Inproceedings
|Referiert=1
|Title=Description Logics Reasoning w.r.t. General TBoxes is decidable for Concrete Domains with the EHD-property.
|To appear=1
|Year=2016
|Month=September
|Booktitle=Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016)
}}
{{Publikation Details
|Abstract=Reasoning for Description Logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate a concrete domain D into the well known description logic ALC, we call the resulting logic ALCP(D).
We then identify sufficient conditions on D that guarantee decidability of the satisfiability problem, even in the presence of general TBoxes. In particular, we show decidability of ALCP(D) for several domains over the integers, for which decidability was open. More generally, this result holds for all negation-closed concrete domains with the EHD-property, which stands for `the existence of a homomorphism is definable'. Such technique has recently been used to show decidability of CTL* with local constraints over the integers.
|Projekt=HAEC B02
|Forschungsgruppe=Automatentheorie
|BibTex=@inproceedings{CT2016,
author = {Claudia Carapelle and Anni-Yasmin Turhan},
title = {Description Logics Reasoning w.r.t. General {TBoxes} is decidable
for Concrete Domains with the {EHD-property}},
booktitle = {Proceedings of the 22nd European Conference on Artificial
Intelligence (ECAI 2016)},
year = {2016},
month = {September},
note ={to appear},
}
}}

Inproceedings3090

2016-06-14T14:07:15Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Anni-Yasmin Turhan;
}}
{{Inproceedings
|Referiert=1
|Title=Description Logics Reasoning w.r.t. General TBoxes is decidable for Concrete Domains with the EHD-property.
|To appear=1
|Year=2016
|Month=September
|Booktitle=Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016)
}}
{{Publikation Details
|Abstract=Reasoning for Description Logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate a concrete domain D into the well known description logic ALC, we call the resulting logic ALCP(D).
We then identify sufficient conditions on D that guarantee decidability of the satisfiability problem, even in the presence of general TBoxes. In particular, we show decidability of ALCP(D) for several domains over the integers, for which decidability was open. More generally, this result holds for all negation-closed concrete domains with the EHD-property, which stands for `the existence of a homomorphism is definable'. Such technique has recently been used to show decidability of CTL* with local constraints over the integers.
|Projekt=HAEC B02
|Forschungsgruppe=Automatentheorie
|BibTex=@inproceedings{CT2016,
author = {Claudia Carapelle and Anni-Yasmin Turhan},
title = {Description Logics Reasoning w.r.t. General {TBoxes} is decidable
for Concrete Domains with the {EHD-property.}},
booktitle = {Proceedings of the 22nd European Conference on Artificial
Intelligence (ECAI 2016)},
year = {2016},
month = {September},
note ={to appear},
}
}}

Inproceedings3090/en

2016-06-14T14:05:56Z

Claudia Carapelle: Page created automatically by parser function on page Inproceedings3090

#REDIRECT [[Inproceedings3090]]

Inproceedings3090

2016-06-14T14:05:55Z

Claudia Carapelle: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Claudia |ErsterAutorNachname=Carapelle |FurtherAuthors=Anni-Yasmin Turhan; }} {{Inproceedings |Referiert=1 |Tit…“

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Anni-Yasmin Turhan;
}}
{{Inproceedings
|Referiert=1
|Title=Description Logics Reasoning w.r.t. General TBoxes is decidable for Concrete Domains with the EHD-property.
|To appear=1
|Year=2016
|Month=September
|Booktitle=Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016)
}}
{{Publikation Details
|Abstract=Reasoning for Description Logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate a concrete domain D into the well known description logic ALC, we call the resulting logic ALCP(D).
We then identify sufficient conditions on D that guarantee decidability of the satisfiability problem, even in the presence of general TBoxes. In particular, we show decidability of ALCP(D) for several domains over the integers, for which decidability was open. More generally, this result holds for all negation-closed concrete domains with the EHD-property, which stands for `the existence of a homomorphism is definable'. Such technique has recently been used to show decidability of CTL* with local constraints over the integers.
|Projekt=HAEC B02
|Forschungsgruppe=Automatentheorie
}}

Inproceedings3078

2016-04-22T09:39:29Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Shiguang Feng; Alexander Kartzow; Markus Lohrey;
}}
{{Inproceedings
|Referiert=1
|Title=Satisfiability of ECTL* with tree constraints
|To appear=0
|Year=2015
|Booktitle=Proceedings of Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia (CSR 2015)
|Pages=94 - 108
|Publisher=Springer International Publishing
|Editor=D. Lev Beklemishev, V. Daniil Musatov
}}
{{Publikation Details
|DOI Name=10.1007/978-3-319-20297-6_7
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@Inbook{Carapelle2015,
author="Carapelle, Claudia
and Feng, Shiguang
and Kartzow, Alexander
and Lohrey, Markus",
editor="Beklemishev, D. Lev
and Musatov, V. Daniil",
chapter="Satisfiability of ECTL* with Tree Constraints",
title="Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings",
year="2015",
publisher="Springer International Publishing",
address="Cham",
pages="94--108",
isbn="978-3-319-20297-6",
doi="10.1007/978-3-319-20297-6_7",
url="http://dx.doi.org/10.1007/978-3-319-20297-6_7"
}
}}

Misc3006

2016-04-22T08:35:43Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Markus Lohrey;
}}
{{Misc
|Title=Temporal Logics with Local Constraints
|Year=2015
|Howpublished=Invited contribution. In Proceedings of the 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
}}
{{Publikation Details
|Abstract=Recent decidability results on the satisfiability problem for temporal logics, in particular LTL, CTL* and ECTL*, with constraints over external structures like the integers with order or infinite trees are surveyed in this paper.
|ISBN=978-3-939897-90-3
|ISSN=1868-8969
|DOI Name=10.4230/LIPIcs.CSL.2015.2
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@InProceedings{carapelle_et_al:LIPIcs:2015:5446,
author = {Claudia Carapelle and Markus Lohrey},
title = {{Temporal Logics with Local Constraints (Invited Talk)}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {2--13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Stephan Kreutzer},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5446},
URN = {urn:nbn:de:0030-drops-54465},
doi = {http://dx.doi.org/10.4230/LIPIcs.CSL.2015.2},
annote = {Keywords: Temporal logics with constraints, concrete domains, LTL, CTL*, ECTL*}
}
}}

ArticleJCSS16

2016-04-22T08:18:36Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Alexander Kartzow; Markus Lohrey
}}
{{Article
|Referiert=1
|Title=Satisfiability of ECTL* with Constraints
|To appear=0
|Year=2016
|Journal=Journal of Computer and System Sciences
|Volume=82
|Number=5
|Pages=826 - 855
|Publisher=Elsevier
}}
{{Publikation Details
|Abstract=We show that satisfiability and finite satisfiability for ECTL* with equality-, order-, and modulo-constraints over the integers are decidable. Since ECTL* is a proper extension of CTL* this greatly improves the previously known decidability results for certain fragments of CTL*, e.g., the existential and positive fragments and EF. We also show that our choice of local constraints is necessary for the result in the sense that, if we add the possibility to state non-local constraints over the integers, the resulting logic becomes undecidable.
|ISSN=0022-0000
|Link=http://authors.elsevier.com/sd/article/S002200001600012X
|DOI Name=10.1016/j.jcss.2016.02.002
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@article{Carapelle2016826,
title = "Satisfiability of ECTL$^*$ with constraints ",
journal = "Journal of Computer and System Sciences ",
volume = "82",
number = "5",
pages = "826 - 855",
year = "2016",
note = "",
issn = "0022-0000",
doi = "http://dx.doi.org/10.1016/j.jcss.2016.02.002",
url = "http://www.sciencedirect.com/science/article/pii/S002200001600012X",
author = "Claudia Carapelle and Alexander Kartzow and Markus Lohrey",
keywords = "Temporal logics with integer constraints",
keywords = "ECTL*",
keywords = "Monadic second-order logic with the bounding quantifier "
}
}}

Misc3006/en

2016-04-22T08:16:42Z

Claudia Carapelle: Page created automatically by parser function on page Misc3006

#REDIRECT [[Misc3006]]

Misc3006

2016-04-22T08:16:41Z

Claudia Carapelle: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Claudia |ErsterAutorNachname=Carapelle |FurtherAuthors=Markus Lohrey; }} {{Misc |Title=Temporal Logics with Loc…“

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Markus Lohrey;
}}
{{Misc
|Title=Temporal Logics with Local Constraints
|Year=2015
|Howpublished=Invited contribution
|Note=In Proceedings of the 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
}}
{{Publikation Details
|ISBN=978-3-939897-90-3
|ISSN=1868-8969
|DOI Name=10.4230/LIPIcs.CSL.2015.2
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@InProceedings{carapelle_et_al:LIPIcs:2015:5446,
author = {Claudia Carapelle and Markus Lohrey},
title = {{Temporal Logics with Local Constraints (Invited Talk)}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {2--13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Stephan Kreutzer},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5446},
URN = {urn:nbn:de:0030-drops-54465},
doi = {http://dx.doi.org/10.4230/LIPIcs.CSL.2015.2},
annote = {Keywords: Temporal logics with constraints, concrete domains, LTL, CTL*, ECTL*}
}
}}

Claudia Carapelle

2016-04-21T12:23:04Z

Claudia Carapelle:

{{Mitarbeiter
|Vorname=Claudia
|Nachname=Carapelle
|Akademischer Titel=Dr.
|Forschungsgruppe=Automatentheorie
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43507
|Email=claudia.carapelle@tu-dresden.de
|Raum=APB 3031
|Bild=Me pic.png
|Info=I completed my PhD in Theoretical Computer Science at Universität Leipzig, Germany, in 2015.
Before that I received a Master's degree in Mathematics from Unversità degli Studi di Firenze, Italy, in 2012.
|Info EN=I completed my PhD in Theoretical Computer Science at Universität Leipzig, Germany, in 2015.
Before that I received a Master's degree in Mathematics from Unversità degli Studi di Firenze, Italy, in 2012.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}

ArticleJCSS16

2016-04-21T12:14:53Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Alexander Kartzow; Markus Lohrey;
}}
{{Article
|Referiert=1
|Title=Satisfiability of ECTL* with Constraints
|To appear=0
|Year=2016
|Journal=Journal of Computer and System Sciences
|Volume=82
|Number=5
|Pages=826 - 855
|Publisher=Elsevier
}}
{{Publikation Details
|Abstract=We show that satisfiability and finite satisfiability for ECTL* with equality-, order-, and modulo-constraints over the integers are decidable. Since ECTL* is a proper extension of CTL* this greatly improves the previously known decidability results for certain fragments of CTL*, e.g., the existential and positive fragments and EF. We also show that our choice of local constraints is necessary for the result in the sense that, if we add the possibility to state non-local constraints over the integers, the resulting logic becomes undecidable.
|Link=http://authors.elsevier.com/sd/article/S002200001600012X
|DOI Name=10.1016/j.jcss.2016.02.002
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@article{Carapelle2016826,
title = "Satisfiability of ECTL$^*$ with constraints ",
journal = "Journal of Computer and System Sciences ",
volume = "82",
number = "5",
pages = "826 - 855",
year = "2016",
note = "",
issn = "0022-0000",
doi = "http://dx.doi.org/10.1016/j.jcss.2016.02.002",
url = "http://www.sciencedirect.com/science/article/pii/S002200001600012X",
author = "Claudia Carapelle and Alexander Kartzow and Markus Lohrey",
keywords = "Temporal logics with integer constraints",
keywords = "ECTL*",
keywords = "Monadic second-order logic with the bounding quantifier "
}
}}

Inproceedings3078/en

2016-04-21T12:13:15Z

Claudia Carapelle: Page created automatically by parser function on page Inproceedings3078

#REDIRECT [[Inproceedings3078]]

Inproceedings3078

2016-04-21T12:13:14Z

Claudia Carapelle: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Claudia |ErsterAutorNachname=Carapelle |FurtherAuthors=Shiguang Feng; Alexander Kartzow; Markus Lohrey; }} {{In…“

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Shiguang Feng; Alexander Kartzow; Markus Lohrey;
}}
{{Inproceedings
|Referiert=1
|Title=Satisfiability of ECTL^* with tree constraints
|To appear=0
|Year=2015
|Booktitle=Proceedings of Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia (CSR 2015)
|Pages=94 - 108
|Publisher=Springer International Publishing
|Editor=D. Lev Beklemishev, V. Daniil Musatov
}}
{{Publikation Details
|DOI Name=10.1007/978-3-319-20297-6_7
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@Inbook{Carapelle2015,
author="Carapelle, Claudia
and Feng, Shiguang
and Kartzow, Alexander
and Lohrey, Markus",
editor="Beklemishev, D. Lev
and Musatov, V. Daniil",
chapter="Satisfiability of ECTL* with Tree Constraints",
title="Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings",
year="2015",
publisher="Springer International Publishing",
address="Cham",
pages="94--108",
isbn="978-3-319-20297-6",
doi="10.1007/978-3-319-20297-6_7",
url="http://dx.doi.org/10.1007/978-3-319-20297-6_7"
}
}}

ArticleJCSS16

2016-04-21T12:04:34Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Alexander Kartzow; Markus Lohrey;
}}
{{Article
|Referiert=1
|Title=Satisfiability of ECTL* with Constraints
|To appear=1
|Year=2016
|Journal=Journal of Computer and System Sciences
|Volume=82
|Number=5
|Pages=826 - 855
|Publisher=Elsevier
}}
{{Publikation Details
|Abstract=We show that satisfiability and finite satisfiability for ECTL* with equality-, order-, and modulo-constraints over the integers are decidable. Since ECTL* is a proper extension of CTL* this greatly improves the previously known decidability results for certain fragments of CTL*, e.g., the existential and positive fragments and EF. We also show that our choice of local constraints is necessary for the result in the sense that, if we add the possibility to state non-local constraints over the integers, the resulting logic becomes undecidable.
|Link=http://authors.elsevier.com/sd/article/S002200001600012X
|DOI Name=10.1016/j.jcss.2016.02.002
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@article{Carapelle2016826,
title = "Satisfiability of ECTL$^*$ with constraints ",
journal = "Journal of Computer and System Sciences ",
volume = "82",
number = "5",
pages = "826 - 855",
year = "2016",
note = "",
issn = "0022-0000",
doi = "http://dx.doi.org/10.1016/j.jcss.2016.02.002",
url = "http://www.sciencedirect.com/science/article/pii/S002200001600012X",
author = "Claudia Carapelle and Alexander Kartzow and Markus Lohrey",
keywords = "Temporal logics with integer constraints",
keywords = "ECTL*",
keywords = "Monadic second-order logic with the bounding quantifier "
}
}}

Inproceedings3077

2016-04-21T10:21:05Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Shiguang Feng; Oliver Fernández Gil; Karin Quaas;
}}
{{Inproceedings
|Referiert=1
|Title=On the expressiveness of MTL and TPTL over omega-data words
|To appear=0
|Year=2014
|Booktitle=Proceedings 14th International Conference on Automata and Formal Languages
|Pages=174--187
|Publisher=Electronic Proceedings in Theoretical Computer Science
|Editor=Zoltán Ésik, Zoltán Fülöp
|Volume=151
}}
{{Publikation Details
|Link=http://arxiv.org/abs/1311.6250v2
|DOI Name=10.4204/EPTCS.151.12
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@Inproceedings{EPTCS151.12,
author = "Carapelle, Claudia and Feng, Shiguang and Fern\'andez Gil, Oliver and Quaas, Karin",
year = "2014",
title = "On the Expressiveness of TPTL and MTL over $\omega$-Data Words",
editor = "\'Esik, Zolt\'an and F\"ul\"op, Zolt\'an",
booktitle = "{\rm Proceedings 14th International Conference on}
Automata and Formal Languages,
{\rm Szeged, Hungary, May 27-29, 2014}",
series = "Electronic Proceedings in Theoretical Computer Science",
volume = "151",
publisher = "Open Publishing Association",
pages = "174-187",
doi = "10.4204/EPTCS.151.12",
}
}}

Inproceedings3077/en

2016-04-21T10:19:30Z

Claudia Carapelle: Page created automatically by parser function on page Inproceedings3077

#REDIRECT [[Inproceedings3077]]

Inproceedings3077

2016-04-21T10:19:29Z

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Shiguang Feng; Oliver Fernández Gil; Karin Quaas;
}}
{{Inproceedings
|Referiert=1
|Title=On the expressiveness of MTL and TPTL over omega-data words
|To appear=0
|Year=2014
|Booktitle=Proceedings 14th International Conference on Automata and Formal Languages
|Pages=174--187
|Publisher=Electronic Proceedings in Theoretical Computer Science
|Editor=Zolt\'an \'Esik, Zolt\'an F\"ul\"op
|Volume=151
}}
{{Publikation Details
|Link=http://arxiv.org/abs/1311.6250v2
|DOI Name=10.4204/EPTCS.151.12
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@Inproceedings{EPTCS151.12,
author = "Carapelle, Claudia and Feng, Shiguang and Fern\'andez Gil, Oliver and Quaas, Karin",
year = "2014",
title = "On the Expressiveness of TPTL and MTL over $\omega$-Data Words",
editor = "\'Esik, Zolt\'an and F\"ul\"op, Zolt\'an",
booktitle = "{\rm Proceedings 14th International Conference on}
Automata and Formal Languages,
{\rm Szeged, Hungary, May 27-29, 2014}",
series = "Electronic Proceedings in Theoretical Computer Science",
volume = "151",
publisher = "Open Publishing Association",
pages = "174-187",
doi = "10.4204/EPTCS.151.12",
}

}}

Carapelle PhDThesis/en

2016-04-21T09:59:17Z

Claudia Carapelle: Page created automatically by parser function on page Carapelle PhDThesis

#REDIRECT [[Carapelle PhDThesis]]

Carapelle PhDThesis

2016-04-21T09:59:16Z

Claudia Carapelle: Claudia Carapelle verschob die Seite En nach Carapelle PhDThesis

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
}}
{{Phdthesis
|Title=On the Satisfiability of Temporal Logics with Concrete Domains
|Instructor=Prof. Dr. Markus Lohrey (Supervisor, Referee)
Prof. Dr. Carsten Lutz (External referee)
Prof. Dr. Franz Baader (Second supervisor)
|Date=2015/11/04
|School= Universität Leipzig
}}
{{Publikation Details
|Download=Carapelle Thesis2015.pdf
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
}}

Carapelle PhDThesis

2016-04-21T09:27:49Z

Claudia Carapelle: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Claudia |ErsterAutorNachname=Carapelle }} {{Phdthesis |Title=On the Satisfiability of Temporal Logics with Concr…“

Datei:Carapelle Thesis2015.pdf

2016-04-21T09:26:27Z

Claudia Carapelle:

Inproceedings3076/en

2016-04-21T08:45:41Z

Claudia Carapelle: Page created automatically by parser function on page Inproceedings3076

#REDIRECT [[Inproceedings3076]]

Inproceedings3076

2016-04-21T08:45:39Z

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Shiguang Feng; Oliver Fernández Gil; Karin Quaas
}}
{{Inproceedings
|Referiert=1
|Title=Satisfiability for MTL and TPTL over non-monotonic data words
|To appear=0
|Year=2014
|Booktitle=Language and Automata Theory and Applications: 8th International Conference, LATA 2014
|Pages=248--259
|Publisher=Springer International Publishing
}}
{{Publikation Details
|DOI Name=10.1007/978-3-319-04921-2_20
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@Inbook{Carapelle2014,
author="Carapelle, Claudia
and Feng, Shiguang
and Fern{\'a}ndez Gil, Oliver
and Quaas, Karin",
editor="Dediu, Adrian-Horia
and Mart{\'i}n-Vide, Carlos
and Sierra-Rodr{\'i}guez, Jos{\'e}-Luis
and Truthe, Bianca",
chapter="Satisfiability for MTL and TPTL over Non-monotonic Data Words",
title="Language and Automata Theory and Applications: 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings",
year="2014",
publisher="Springer International Publishing",
address="Cham",
pages="248--259",
isbn="978-3-319-04921-2",
doi="10.1007/978-3-319-04921-2_20",
url="http://dx.doi.org/10.1007/978-3-319-04921-2_20"
}

}}

ArticleJCSS16

2016-03-23T09:27:58Z

Claudia Carapelle:

ArticleJCSS16

2016-03-23T09:24:17Z

Claudia Carapelle:

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Alexander Kartzow; Markus Lohrey;
}}
{{Inproceedings
|Referiert=1
|Title=Satisfiability of CTL* with constraints
|To appear=0
|Year=2013
|Booktitle=Concurrency Theory: 24th International Conference, CONCUR 2013
|Pages=455-469
|Publisher=Springer
|Series=LNCS
|Volume=8052
}}
{{Publikation Details
|Abstract=We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over the integers is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.
|Link=http://dx.doi.org/10.1007/978-3-642-40184-8_32
|DOI Name=10.1007/978-3-642-40184-8_32
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
|BibTex=@Inbook{Carapelle2013,
author="Carapelle, Claudia
and Kartzow, Alexander
and Lohrey, Markus",
editor="D'Argenio, Pedro R.
and Melgratti, Hern{\'a}n",
chapter="Satisfiability of CTL* with Constraints",
title="CONCUR 2013 -- Concurrency Theory: 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings",
year="2013",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="455--469",
isbn="978-3-642-40184-8",
doi="10.1007/978-3-642-40184-8_32",
url="http://dx.doi.org/10.1007/978-3-642-40184-8_32"
}

}}
{{Article
|Referiert=0
|Title=Satisfiability of ECTL* with Constraints
|To appear=1
|Year=2016
|Journal=Journal of Computer and System Sciences
}}

ArticleJCSS16

2016-03-23T09:12:58Z

Claudia Carapelle: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Claudia |ErsterAutorNachname=Carapelle |FurtherAuthors=Alexander Kartzow; Markus Lohrey; }} {{Article |Referier…“

{{Publikation Erster Autor
|ErsterAutorVorname=Claudia
|ErsterAutorNachname=Carapelle
|FurtherAuthors=Alexander Kartzow; Markus Lohrey;
}}
{{Article
|Referiert=0
|Title=Satisfiability of ECTL* with Constraints
|To appear=1
|Year=2016
|Journal=Journal of Computer and System Sciences
}}
{{Publikation Details
|Abstract=We show that satisfiability and finite satisfiability for ECTL* with equality-, order-, and modulo-constraints over Z are decidable. Since ECTL* is a proper extension of CTL*, this greatly improves the previously known decidability results for certain fragments of CTL*, e.g., the existential and positive fragments and EF. We also show that our choice of local constraints is necessary for the result in the sense that, if we add the possibility to state non-local constraints over Z, the resulting logic becomes undecidable.
|Link=http://authors.elsevier.com/sd/article/S002200001600012X
|DOI Name=10.1016/j.jcss.2016.02.002
|Projekt=QuantLA
|Forschungsgruppe=Automatentheorie
}}

Claudia Carapelle

2016-03-23T09:03:29Z

Claudia Carapelle:

{{Mitarbeiter
|Vorname=Claudia
|Nachname=Carapelle
|Akademischer Titel=Dr
|Forschungsgruppe=Automatentheorie
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43507
|Email=claudia.carapelle@tu-dresden.de
|Raum=APB 3031
|Bild=Me pic.png
|Info=I completed my PhD in Theoretical Computer Science at Universität Leipzig, Germany, in 2015.
Before that I received a Master's degree in Mathematics from Unversità degli Studi di Firenze, Italy, in 2012.
|Info EN=I completed my PhD in Theoretical Computer Science at Universität Leipzig, Germany, in 2015.
Before that I received a Master's degree in Mathematics from Unversità degli Studi di Firenze, Italy, in 2012.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}

Datei:Me pic.png

2016-03-23T09:03:21Z

Claudia Carapelle:

Claudia Carapelle

2016-03-23T08:50:36Z

Claudia Carapelle:

Claudia Carapelle

2016-03-23T08:41:44Z

Claudia Carapelle: