457 search results - page 7 / 92 » Boolean algebras arising from information systems |
IJAC
2002
14 years 9 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
151
Voted
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) ? t...
80
Voted
DAC
2004
ACM
15 years 10 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we report on an experience communicating two computer algebra systems, namely GAP (and more concretely, its HAP package to compute in Homological Algebra) and Kenzo ...
126
click to vote
FROCOS
2009
Springer
15 years 4 months ago
2009
Springer
When trying to apply recently developed approaches for updating Description Logic ABoxes in the context of an action programming language, one encounters two problems. First, upda...