Sciweavers

258 search results - page 3 / 52
» Hybrid Logics on Linear Structures: Expressivity and Complex...
Sort
View
IANDC
2007
111views more  IANDC 2007»
13 years 7 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
CSL
1999
Springer
13 years 11 months ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx
STACS
2007
Springer
14 years 1 months ago
Bounded-Variable Fragments of Hybrid Logics
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
Thomas Schwentick, Volker Weber
ICRA
2007
IEEE
124views Robotics» more  ICRA 2007»
14 years 1 months ago
Using Constrained Intuitionistic Linear Logic for Hybrid Robotic Planning Problems
— Synthesis of robot behaviors towards nontrivial goals often requires reasoning about both discrete and continuous aspects of the underlying domain. Existing approaches in build...
Uluc Saranli, Frank Pfenning
ICTCS
2003
Springer
14 years 20 days ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui