Sciweavers

330 search results - page 51 / 66
» Open Problems in Logic and Games
Sort
View
PODS
2007
ACM
139views Database» more  PODS 2007»
14 years 8 months ago
Management of probabilistic data: foundations and challenges
Many applications today need to manage large data sets with uncertainties. In this paper we describe the foundations of managing data where the uncertainties are quantified as pro...
Nilesh N. Dalvi, Dan Suciu
RP
2010
Springer
150views Control Systems» more  RP 2010»
13 years 5 months ago
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
Paulin Jacobé de Naurois, Virgile Mogbil
APAL
2007
99views more  APAL 2007»
13 years 8 months ago
A categorical semantics for polarized MALL
In this paper, we present a categorical model for Multiplicative Additive Polarized Linear Logic MALLP, which is the linear fragment (without structural rules) of Olivier Laurentâ...
Masahiro Hamano, Philip J. Scott
CAV
2009
Springer
215views Hardware» more  CAV 2009»
14 years 8 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 8 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge