Satisfiability for MTL and TPTL over non-monotonic data words
From International Center for Computational Logic
Satisfiability for MTL and TPTL over non-monotonic data words
Claudia CarapelleClaudia Carapelle, Shiguang FengShiguang Feng, Oliver Fernández GilOliver Fernández Gil, Karin QuaasKarin Quaas
Claudia Carapelle, Shiguang Feng, Oliver Fernández Gil, Karin Quaas
Satisfiability for MTL and TPTL over non-monotonic data words
Language and Automata Theory and Applications: 8th International Conference, LATA 2014, 248--259, 2014. Springer International Publishing
Satisfiability for MTL and TPTL over non-monotonic data words
Language and Automata Theory and Applications: 8th International Conference, LATA 2014, 248--259, 2014. Springer International Publishing
- Projekt:Project: QuantLA
- Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@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"
}