Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

STACS
2007
Springer

favoriteEmaildiscussreport

121views Theoretical Computer Science» more STACS 2007»

Bounded-Variable Fragments of Hybrid Logics

13 years 10 months ago

Bounded-Variable Fragments of Hybrid Logics

Download ls1-www.cs.uni-dortmund.de

Hybrid logics extend modal logics by ﬁrst-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisﬁability for hybrid formulas is undecidable and model checking is PSPACE-hard. It is shown here that on the linear frame (ω, <), the restriction to one name, although expressively complete, has EXPSPACEcomplete satisﬁability and polynomial time model-checking. For the upper bound, a result of independent interest is found: Nonemptiness for alternating two-way B¨uchi automata with one pebble is EXPSPACE-complete.

Thomas Schwentick, Volker Weber

Real-time Traffic

Hybrid Formulas | Hybrid Logics | Modal Logics | STACS 2007 | Theoretical Computer Science |

claim paper

Related Content

» The complexity of satisfiability for fragments of hybrid logic Part I

» Nominal Unification from a HigherOrder Perspective

» Tableau Calculi for Hybrid Logics

» Hybrid logic with the difference modality for generalisations of graphs

» Hybrid Logics on Linear Structures Expressivity and Complexity

» Local closed world reasoning with description logics under the wellfounded semantics

» Hybrid Reasoning with Forest Logic Programs

» A Faithful Integration of Description Logics with Logic Programming

» A hybrid SATbased decision procedure for separation logic with uninterpreted functions

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	STACS
Authors	Thomas Schwentick, Volker Weber

Comments (0)