✦ LIBER ✦

Total complexity and the inference of best programs

✍ Scribed by Jerome A. Feldman; Paul C. Shields

Publisher: Springer
Year: 1976
Tongue: English
Weight: 703 KB
Volume: 10
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01683271

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of revising logic program

The complexity of revising logic programs

✍ Russell Greiner 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 237 KB

A rule-based program will return a set of answers to each query. An impure program, which includes the Prolog ut ``!'' and ``not@ÁA'' operators, can return dierent answers if its rules are re-ordered. There are also many reasoning systems that return only the ®rst answer found for each query; these

Cartesian Skepticism and Inference to th

Cartesian Skepticism and Inference to the Best Explanation

✍ Vogel, Jonathan 📂 Fiction 📅 0 🌐 English ⚖ 920 KB

The Complexity of Circumscriptive Infere

The Complexity of Circumscriptive Inference in Post’s Lattice

✍ Michael Thomas 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 688 KB

Notes on the complexity of systolic prog

Notes on the complexity of systolic programs

✍ Stephen Taylor; Lisa Hellerstein; Shmuel Safra; Ehud Shapiro 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 894 KB

The Garland Measure and Computational Co

The Garland Measure and Computational Complexity of Stack Programs

✍ L. Kristiansen; K.-H. Niggl 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 268 KB

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