𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Complexity of Circumscriptive Inference in Post’s Lattice

✍ Scribed by Michael Thomas

Publisher
Springer
Year
2011
Tongue
English
Weight
688 KB
Volume
50
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of lattice knots
The complexity of lattice knots
✍ Y. Diao; C. Ernst 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 429 KB

A family of polygonal knots K, on the cubical lattice is constructed with the property that the quotient of length L(Kn) over the crossing number Cr(Kn) approaches zero as L approaches infinity. More precisely Cr(K,) = 0(L(Kn)4/3). It is shown that this construction is optimal in the sense that for

On the complexity of inference about pro
On the complexity of inference about probabilistic relational models
✍ Manfred Jaeger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 120 KB

We investigate the complexity of probabilistic inference from knowledge bases that encode probability distributions on finite domain relational structures. Our interest here lies in the complexity in terms of the domain under consideration in a specific application instance. We obtain the result tha

The computational complexity of probabil
The computational complexity of probabilistic inference using bayesian belief networks
✍ Gregory F. Cooper 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 708 KB

Bayesian belief networks provide a natural, efficient method for representing probabilistic dependencies among a set of variables. For these reasons, numerous researchers are exploring the use of belief networks as a knowledge representation m artificial intelligence. Algorithms have been developed