Sciweavers

186 search results - page 2 / 38
» Decidable Extensions of Church's Problem
Sort
View
ICALP
2009
Springer
13 years 10 months ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
FSTTCS
2008
Springer
13 years 6 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
DAM
2006
91views more  DAM 2006»
13 years 5 months ago
Precoloring extension on unit interval graphs
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
Dániel Marx
JAIR
2011
166views more  JAIR 2011»
13 years 9 days 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...
LFCS
2007
Springer
13 years 11 months ago
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier