Sciweavers

2050 search results - page 88 / 410
» constraints 2010
Sort
View
RTA
2010
Springer
14 years 1 months ago
Polynomially Bounded Matrix Interpretations
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
Johannes Waldmann
TCS
2010
13 years 4 months ago
An exact correspondence between a typed pi-calculus and polarised proof-nets
This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed -calculus based on IO-typing. The respective incremental constraints,...
Kohei Honda, Olivier Laurent
AMW
2010
13 years 11 months ago
On the Decidability of Consistent Query Answering
Abstract. Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certa...
Marcelo Arenas, Leopoldo E. Bertossi
IJIS
2010
110views more  IJIS 2010»
13 years 7 months ago
The ramification problem in temporal databases: Concurrent execution
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
Nikos Papadakis, Dimitris Plexousakis, Grigoris An...
JDA
2010
122views more  JDA 2010»
13 years 4 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos