Abstract | ||
---|---|---|
We propose a general framework for structure identification, as defined by Dechter and Pearl. It is based on the notion of prime implicate, and handles Horn, bijunctive and affine, as well as Horn-renamable formulas, for which, to our knowledge, no polynomial algorithm has been proposed before. This framework, although quite general, gives good complexity results, and in particular we get for Horn formulas the same running time and better output size than the algorithms previously known. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1016/S0020-0190(01)00247-2 | Inf. Process. Lett. |
Keywords | Field | DocType |
unified framework,structure identification,affine | Prime (order theory),Affine transformation,Discrete mathematics,Combinatorics,Conjunctive normal form,Polynomial algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
81 | 6 | 0020-0190 |
Citations | PageRank | References |
12 | 0.79 | 6 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bruno Zanuttini | 1 | 289 | 25.43 |
Jean-jacques Hébrard | 2 | 69 | 5.78 |