Sciweavers

178 search results - page 6 / 36
» Boolean Algebras in Visser Algebras
Sort
View
ICDE
2008
IEEE
106views Database» more  ICDE 2008»
14 years 5 months ago
Weighted Boolean conditions for ranking
— Current database systems are tailored to efficiently evaluate Boolean expressions which are typically used as selection conditions to restrict the result set. We propose to ad...
Matthias Beck, Burkhard Freitag
APAL
2007
77views more  APAL 2007»
13 years 11 months ago
The hyper-weak distributive law and a related game in Boolean algebras
We discuss the relationship between various weak distributive laws and games in Boolean algebras. In the first part we give some game characterizations for certain forms of Prikr...
James Cummings, Natasha Dobrinen
AI
2000
Springer
13 years 10 months ago
Boolean connection algebras: A new approach to the Region-Connection Calculus
The Region-Connection Calculus (RCC) is a well established formal system for qualitative spatial reasoning. It provides an axiomatization of space which takes regions as primitive...
John G. Stell
AML
2010
99views more  AML 2010»
13 years 11 months ago
Effectively inseparable Boolean algebras in lattices of sentences
We show the non-arithmeticity of 1st order theories of lattices of n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithm...
V. Yu. Shavrukov
CADE
2007
Springer
14 years 11 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard