Sciweavers

ICDT
2012
ACM
293views Database» more  ICDT 2012»
13 years 9 months ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 9 months ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 9 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
LICS
2012
IEEE
13 years 9 months ago
Graph Logics with Rational Relations and the Generalized Intersection Problem
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
Pablo Barceló, Diego Figueira, Leonid Libki...
LICS
2012
IEEE
13 years 9 months ago
The Complete Proof Theory of Hybrid Systems
—Hybrid systems are a fusion of continuous dynamical systems and discrete dynamical systems. They freely combine dynamical features from both worlds. For that reason, it has ofte...
André Platzer
LICS
2012
IEEE
13 years 9 months ago
The Winning Ways of Concurrent Games
Abstract—A bicategory of concurrent games, where nondeterministic strategies are formalized as certain maps of event structures, was introduced recently. This paper studies an ex...
Pierre Clairambault, Julian Gutierrez, Glynn Winsk...
LICS
2012
IEEE
13 years 9 months ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard

0
posts
with
0
views
23profile views
gonsannodatProfessor
Commack
LICS
2012
IEEE
13 years 9 months ago
Logics of Dynamical Systems
—We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the s...
André Platzer
LICS
2012
IEEE
13 years 9 months ago
Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving
—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional approach, reducing high-level specifications to logical primitives. This al...
Dmitriy Traytel, Andrei Popescu, Jasmin Christian ...