๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of deciding typability in the relational algebra

โœ Scribed by Stijn Vansummeren

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
177 KB
Volume
41
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

On the decidability and complexity of re
On the decidability and complexity of reasoning about only knowing
โœ Riccardo Rosati ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 205 KB

We study reasoning in Levesque's logic of only knowing. In particular, we first prove that extending a decidable subset of first-order logic with the ability of reasoning about only knowing preserves decidability of reasoning, as long as quantifying-in is not allowed in the language, and define a ge