Sciweavers

16 search results - page 1 / 4
» Metric Propositional Neighborhood Logics: Expressiveness, De...
Sort
View
ECAI
2010
Springer
13 years 5 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
LFCS
2007
Springer
13 years 10 months ago
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
JAIR
2011
166views more  JAIR 2011»
12 years 11 months ago
Decidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
IANDC
2007
127views more  IANDC 2007»
13 years 4 months ago
Temporal logics with incommensurable distances are undecidable
Temporal logic based on the two modalities “Since” and “Until” (TL) is the most popular logic for the specification of reactive systems. It is often called the linear tim...
Alexander Rabinovich
AIML
2006
13 years 6 months ago
From topology to metric: modal logic and quantification in metric spaces
We propose a framework for comparing the expressive power and computational behaviour of modal logics designed for reasoning about qualitative aspects of metric spaces. Within this...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...