119 search results - page 19 / 24 » Normal Forms for Knowledge Compilation |
97
Voted
STACS
2004
Springer
15 years 6 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
126
Voted
PKDD
1998
Springer
15 years 5 months ago
1998
Springer
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
123
Voted
IAT
2009
IEEE
15 years 5 months ago
2009
IEEE
Recently, multi-attribute negotiation has been extensively studied from a game-theoretic viewpoint. Since normal and extensive form games have the drawback of requiring an explicit...
94
Voted
KDD
1997
ACM
15 years 4 months ago
1997
ACM
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
107
Voted
MICS
2010
14 years 11 months ago
2010
Strategies specify how a wide range of exercises can be solved incrementally, such as bringing a logic proposition to disjunctive normal form, reducing a matrix, or calculating wit...