Sciweavers

164 search results - page 7 / 33
» A Decidable Fragment of Separation Logic
Sort
View
LICS
2008
IEEE
14 years 2 months ago
Correctness of Multiplicative Additive Proof Structures is NL-Complete
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
Paulin Jacobé de Naurois, Virgile Mogbil
ICLP
2003
Springer
14 years 26 days ago
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
Frank D. Valencia
CIE
2008
Springer
13 years 9 months ago
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex...
Matthias Baaz, George Metcalfe
LICS
2005
IEEE
14 years 1 months ago
On the Decidability of Metric Temporal Logic
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
Joël Ouaknine, James Worrell
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 months ago
On the decidability and complexity of Metric Temporal Logic over finite words
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
Joël Ouaknine, James Worrell