738 search results - page 78 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
AGP
1999
IEEE
15 years 2 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
ICSE
2004
IEEE-ACM
15 years 10 months ago
2004
IEEE-ACM
An important emerging requirement for computing systems is the ability to adapt at run time, taking advantage of local computing devices, and coping with dynamically changing reso...
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
ERSHOV
2006
Springer
15 years 1 months ago
2006
Springer
In this work, we present a semantic query optimization technique to improve the efficiency of the evaluation of a subset of SQL:1999 recursive queries. Using datalog notation, we c...