Sciweavers

7123 search results - page 133 / 1425
» The Ordered Set of Rough Sets
Sort
View
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
14 years 1 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
FAW
2008
Springer
111views Algorithms» more  FAW 2008»
13 years 12 months ago
Efficient First-Order Model-Checking Using Short Labels
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
DCG
2000
67views more  DCG 2000»
13 years 10 months ago
A Theorem on Higher Bruhat Orders
We show that inclusion order and single-step inclusion coincide for higher Bruhat orders B(n; 2), i.e., B(n; 2) = B (n; 2). Mathematics Subject Classi cations (1991). 06A06, 51G05,...
Stefan Felsner, Helmut Weil
LPNMR
2001
Springer
14 years 2 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
CVPR
2006
IEEE
15 years 5 days ago
Fully Automatic Registration of 3D Point Clouds
We propose a novel technique for the registration of 3D point clouds which makes very few assumptions: we avoid any manual rough alignment or the use of landmarks, displacement ca...
Ameesh Makadia, Alexander Patterson, Kostas Daniil...