✦ LIBER ✦

Annotated Logic Applications for Imperfect Information

✍ Scribed by Daniela V. Carbogim; Flávio S. Corrêa da Silva

Book ID: 110261042
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 238 KB
Volume: 9
Category: Article
ISSN: 0924-669X
DOI: 10.1023/a:1008268003741

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Termination of logic programs with imper

Termination of logic programs with imperfect information: applications and query procedure

✍ C.V. Damásio; J. Medina; M. Ojeda-Aciego 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Expressivity of Imperfect Information Lo

Expressivity of Imperfect Information Logics without Identity

✍ Antti Kuusisto 📂 Article 📅 2013 🏛 Springer Netherlands 🌐 English ⚖ 355 KB

Algebras and Matrices for Annotated Logi

Algebras and Matrices for Annotated Logics

✍ R.A. Lewin; I.F. Mikenberg; M.G. Schwarze 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 213 KB

Lottery Semantics: A Compositional Seman

Lottery Semantics: A Compositional Semantics for Probabilistic First-Order Logic with Imperfect Information

✍ Pietro Galliani, Allen L. Mann 📂 Article 📅 2013 🏛 Springer Netherlands 🌐 English ⚖ 332 KB

Targeted policies for poverty alleviatio

Targeted policies for poverty alleviation under imperfect information: Algorithms and applications

✍ Martin Ravallion; Kalvin Chao 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 590 KB

Probabilistic datalog: Implementing logi

Probabilistic datalog: Implementing logical information retrieval for advanced applications

✍ Fuhr, Norbert 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 2 views

In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Datalog (function-free Horn clause predicate logic) with probability theory. Therefore, probabilistic weights may be attache