Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
119
Voted
ICALP
2010
Springer
137
views
Programming Languages
»
more
ICALP 2010
»
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals
15 years 23 days ago
Download
www.comlab.ox.ac.uk
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations "meets", "met by", "begun by", and "begins" of Allen's interval algebra (A
Angelo Montanari, Gabriele Puppis, Pietro Sala
Real-time Traffic
ICALP 2010
|
Linear Order
|
Logic
|
Programming Languages
|
Propositional Neighborhood Logic
|
claim paper
Related Content
»
B and D Are Enough to Make the HalpernShoham Logic Undecidable
»
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings
»
Undecidability of Interval Temporal Logics with the Overlap Modality
»
A New Modal Approach to the Logic of Intervals
more »
Post Info
More Details (n/a)
Added
11 Feb 2011
Updated
11 Feb 2011
Type
Journal
Year
2010
Where
ICALP
Authors
Angelo Montanari, Gabriele Puppis, Pietro Sala
Comments
(0)
Researcher Info
Programming Languages Study Group
Computer Vision