Name
Abstract | ||
|---|---|---|
Given a Horn CNF representing a Boolean function f, the problem of Horn minimization consists in constructing a CNF representation of f which has a minimum possible number of clauses. This problem is the formalization of the problem of knowledge compression for speeding up queries to propositional Horn expert systems, and it is known to be NP‐hard. In this paper we present a linear time algorithm which takes a Horn CNF as an input, and through a series of decompositions reduces the minimization of the input CNF to the minimization problem on a “shorter” CNF. The correctness of this decomposition algorithm rests on several interesting properties of Horn functions which, as we prove here, turn out to be independent of the particular CNF representations. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1023/A:1018932728409 | Ann. Math. Artif. Intell. |
Keywords | Field | DocType |
Boolean Function,Directed Path,Propositional Variable,Strong Component,Procedure Decomposition | Boolean function,Minimization problem,Discrete mathematics,Correctness,Expert system,Algorithm,Minification,Artificial intelligence,Time complexity,Machine learning,Mathematics,Propositional variable | Journal |
Volume | Issue | ISSN |
23 | 3-4 | 1573-7470 |
Citations | PageRank | References |
9 | 0.55 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Endre Boros | 1 | 1779 | 155.63 |
| Ondřej Čepek | 2 | 59 | 8.30 |
| A. Kogan | 3 | 142 | 12.92 |