Sciweavers

178 search results - page 26 / 36
» Boolean Algebras in Visser Algebras
Sort
View
SETA
2004
Springer
93views Mathematics» more  SETA 2004»
15 years 3 months ago
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
Lars Eirik Danielsen, Matthew G. Parker
67
Voted
APAL
2008
87views more  APAL 2008»
14 years 9 months ago
Characterising nested database dependencies by fragments of propositional logic
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
Sven Hartmann, Sebastian Link
AIML
2004
14 years 11 months ago
On Notions of Completeness Weaker than Kripke Completeness
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
Tadeusz Litak
ISCI
2008
108views more  ISCI 2008»
14 years 9 months ago
Modeling and manipulating the structure of hierarchical schemas for the web
The Semantic Web is the next step of the current Web where information will become more machine-understandable to support effective data discovery and integration. Hierarchical sc...
Theodore Dalamagas, Alexandra Meliou, Timos K. Sel...
FOIKS
2006
Springer
15 years 1 months ago
Equational Constraint Solving Via a Restricted Form of Universal Quantification
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...
Javier Álvez, Paqui Lucio