Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers

DOI10.1007/978-3-540-85762-4_9zbMath1161.68567MaRDI QIDQ5505598

Carlo A. Furia, Paola Spoletini

Publication date: 27 January 2009

Published in: Theoretical Aspects of Computing - ICTAC 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85762-4_9

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03D05: Automata and formal grammars in connection with logical questions

68Q60: Specification and verification (program logics, model checking, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

03B44: Temporal logic

Cites Work

• Real-time logics: Complexity and expressiveness
• The complexity of propositional linear temporal logics in simple cases
• Model Checking Temporal Metric Specifications with Trio2Promela
• The complexity of propositional linear temporal logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item