2050 search results - page 88 / 410 » constraints 2010 |
134
Voted
RTA
2010
Springer
15 years 7 months ago
2010
Springer
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...
108
click to vote
TCS
2010
14 years 10 months ago
2010
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,...
134
click to vote
AMW
2010
15 years 5 months ago
2010
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...
128
click to vote
IJIS
2010
15 years 1 months ago
2010
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 ...
136
click to vote
JDA
2010
14 years 10 months ago
2010
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...