Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

ISMIS
2005
Springer

favoriteEmaildiscussreport

160views Artificial Intelligence» more ISMIS 2005»

Normal Forms for Knowledge Compilation

14 years 4 months ago

Normal Forms for Knowledge Compilation

Download www.cse.chalmers.se

A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operates in PSPACE.Ordered factored negation normal form provides a canonical representation for any boolean function. Reduction strategies are developed that provide a unique reduced factored negation normal form. These compilation techniques work well with negated form as input, and it is shown that any logical formula can be translated into negated form in linear time.

Reiner Hähnle, Neil V. Murray, Erik Rosenthal

Real-time Traffic

ISMIS 2005 | Negated Form | Negation Normal Form | Reduced Factored Negation |

claim paper

Related Content

» Prime Implicate Normal Form for ALC Concepts

» Knowledge Compilation for Description Logics

» Knowledge Compilation in the Modal Logic S5

» A Knowledge Compilation Technique for ALC Tboxes

» Compilation of Head and Strong Reduction

» Description Logic Programs Normal Forms

» On the Expressiveness of Levesques Normal Form

» A Lower Bound on the Size of Decomposable Negation Normal Form

» Planning against fictitious players in repeated normal form games

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ISMIS
Authors	Reiner Hähnle, Neil V. Murray, Erik Rosenthal

Comments (0)