Sciweavers

1818 search results - page 125 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
PLANX
2007
13 years 11 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
DBSEC
2003
137views Database» more  DBSEC 2003»
13 years 11 months ago
Certifying Data from Multiple Sources
Abstract Data integrity can be problematic when integrating and organizing information from many sources. In this paper we describe efficient mechanisms that enable a group of data...
Glen Nuckolls, Charles U. Martel, Stuart G. Stubbl...
ECCC
2006
99views more  ECCC 2006»
13 years 10 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
IJSI
2008
109views more  IJSI 2008»
13 years 10 months ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama
ECCC
2007
99views more  ECCC 2007»
13 years 10 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi