Projective DNF Formulae and Their Revision
نویسندگان
چکیده
Combinatorial and learnability results are proven for projective disjunctive normal forms, a class of DNF expressions introduced by Valiant. Dedicated to Prof. Peter Hammer on the occasion of his 70th birthday.
منابع مشابه
Revising Projective DNF in the presence of noise
A noise tolerant revision algorithm is given for the class of projective DNFs, a special class of DNF introduced by Valiant in [13].
متن کاملDalal's Revision without Hamming Distance
A well known strategy for belief revision is the use of an operator which takes as input a belief base and formula and outputs a new consistent revised belief base. Many operators require additional information such as epistemic entrenchment relations, system of spheres, faithful orderings, subformulae relation, etc. However, in many applications this extra information does not exist and all be...
متن کاملOpen Archive TOULOUSE Archive Ouverte (OATAO)
A well known strategy for belief revision is the use of an operator which takes as input a belief base and formula and outputs a new consistent revised belief base. Many operators require additional information such as epistemic entrenchment relations, system of spheres, faithful orderings, subformulae relation, etc. However, in many applications this extra information does not exist and all be...
متن کاملMolecular Learning of wDNF Formulae
We introduce a class of generalized DNF formulae called wDNF or weighted disjunctive normal form, and present a molecular algorithm that learns a wDNF formula from training examples. Realized in DNA molecules, the wDNF machines have a natural probabilistic semantics, allowing for their application beyond the pure Boolean logical structure of the standard DNF to real-life problems with uncertain...
متن کاملPreprocessing Boolean Formulae for BDDs in a Probabilistic Context
Inference in many probabilistic logic systems is based on representing the proofs of a query as a DNF Boolean formula. Assessing the probability of such a formula is known as a #P-hard task. In practice, a large DNF is given to a BDD software package to construct the corresponding BDD. The DNF has to be transformed into the input format of the package. This is the preprocessing step. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003