Sciweavers

ICDT
2012
ACM
293views Database» more  ICDT 2012»
12 years 1 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
JSAT
2007
47views more  JSAT 2007»
13 years 10 months ago
On Solving Boolean Combinations of UTVPI Constraints
We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at mos...
Sanjit A. Seshia, K. Subramani, Randal E. Bryant
APAL
2005
115views more  APAL 2005»
13 years 10 months ago
Completeness of S4 with respect to the real line: revisited
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (...
Guram Bezhanishvili, Mai Gehrke
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 11 months ago
Combining decision procedures for the reals
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
Jeremy Avigad, Harvey Friedman
WSCG
2003
149views more  WSCG 2003»
14 years 8 days ago
Boolean Operations on Feature-based Models
Boolean operations and feature-based modeling are closely linked domains. For example, several, sometimes many Boolean operations are involved during a feature instantiation or mo...
Yvon Gardan, Christian Minich, Estelle Perrin
DLOG
2003
14 years 8 days ago
Handling Boolean A Boxes
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear redu...
Carlos Areces, Patrick Blackburn, Bernadette Mart&...
DLT
2008
14 years 10 days ago
Hierarchies of Piecewise Testable Languages
The classes of languages which are boolean combinations of languages of the form A a1A a2A . . . A a A , where a1, . . . , a A, k , for a fixed k 0, form a natural hierarchy wit...
Ondrej Klíma, Libor Polák
COMPGEOM
1995
ACM
14 years 2 months ago
Representation and Computation of Boolean Combinations of Sculptured Models
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
Shankar Krishnan, Atul Narkhede, Dinesh Manocha
SAT
2004
Springer
109views Hardware» more  SAT 2004»
14 years 4 months ago
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints
The problem of solving boolean combinations of difference constraints is at the core of many important techniques such as planning, scheduling, and model-checking of real-time syst...
Alessandro Armando, Claudio Castellini, Enrico Giu...