Sciweavers

23 search results - page 3 / 5
» japll 2006
Sort
View
JAPLL
2006
114views more  JAPLL 2006»
13 years 5 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
JAPLL
2006
109views more  JAPLL 2006»
13 years 5 months ago
Deduction chains for common knowledge
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
Mathis Kretz, Thomas Studer
JAPLL
2006
90views more  JAPLL 2006»
13 years 5 months ago
Definability and decidability of binary predicates for time granularity
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures...
Massimo Franceschet, Angelo Montanari, Adriano Per...
JAPLL
2010
124views more  JAPLL 2010»
13 years 3 months ago
Reasoning about XML with temporal logics and automata
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of pr...
Leonid Libkin, Cristina Sirangelo
JAPLL
2010
98views more  JAPLL 2010»
13 years 3 months ago
On database query languages for K-relations
The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiring K. A query language, denoted by RAC K , similar ...
Floris Geerts, Antonella Poggi