Loading...
Please wait, while we are loading the content...
Similar Documents
Knowledge Compilation : Decomposable Negation Normal Form versus Linkless Formulas ?
| Content Provider | Semantic Scholar |
|---|---|
| Author | Murray, Neil V. Rosenthal, Erik |
| Copyright Year | 2003 |
| Abstract | Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkles s, in negation normal form (NNF), and have the property that atoms are not share d cross conjunctions. Full dissolvents are linkless NNF formulas that do no t i general have the latter property. However, many of the applications of DNNF c an be obtained with full dissolvents. Two additional methods — regular tableau x ndsemantic factoring — are shown to produce equivalent DNNF. A class of formulae is presented on which earlier DNNF conversion techniques are necessaril y exponential; path dissolution and semantic factoring handle these formulae i n linear time. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=67197098960D9AE6B5841949E0E7B08F?doi=10.1.1.10.5913&rep=rep1&type=pdf |
| Alternate Webpage(s) | http://www.cs.miami.edu/~geoff/Conferences/CADE/Archive/CADE-19/WS4/10.pdf |
| Alternate Webpage(s) | http://www.uni-koblenz.de/~peter/models03/final/murray/murray.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |