ICDT
2012
ACM
11 years 7 months ago
2012
ACM
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
JSAT
2007
13 years 4 months ago
2007
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...
APAL
2005
13 years 4 months ago
2005
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 (...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
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...
WSCG
2003
13 years 5 months ago
2003
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...
DLOG
2003
13 years 6 months ago
2003
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...
DLT
2008
13 years 6 months ago
2008
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...
COMPGEOM
1995
ACM
13 years 8 months ago
1995
ACM
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...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
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...