𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Can approximate reasoning be consistent?

✍ Scribed by James J. Buckley; Yoichi Hayashi


Book ID
104170245
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
420 KB
Volume
65
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Can legal reasoning be demystified?
✍ Geoffrey Samuel πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 166 KB
Can Datalog Be Approximated?
✍ Surajit Chaudhuri; Phokion G. Kolaitis πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 452 KB

In this paper, we investigate whether recursive Datalog predicates can be approximated by finite unions of conjunctive queries. We introduce a quantitative notion of error and examine two types of approximation, namely, absolute approximation and relative approximation. We also stipulate that the ap

Balanced approximation can be optimal
✍ D. Mustafa; T.N. Davidson πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 272 KB