Sciweavers

227 search results - page 23 / 46
» Second-order logic on equivalence relations
Sort
View
CSL
2008
Springer
13 years 10 months ago
On the Almighty Wand
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Rémi Brochenin, Stéphane Demri, &Eac...
LICS
1990
IEEE
14 years 20 days ago
Normal Process Representatives
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
Vijay Gehlot, Carl A. Gunter
CORR
1999
Springer
95views Education» more  CORR 1999»
13 years 8 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
DBPL
1995
Springer
106views Database» more  DBPL 1995»
14 years 6 days ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
ICDT
2010
ACM
195views Database» more  ICDT 2010»
14 years 22 days ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich