✦ LIBER ✦

Using Abduction to Compute Efficient Proofs

✍ Scribed by Marcelo Finger

Book ID: 108127123
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 254 KB
Volume: 247
Category: Article
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.07.047

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms to compute Hankel t

Efficient algorithms to compute Hankel transforms using wavelets

✍ Vineet K. Singh; Om P. Singh; Rajesh K. Pandey 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 751 KB

Efficient Methods to Compute Genomic Pre

Efficient Methods to Compute Genomic Predictions

✍ P.M. VanRaden 📂 Article 📅 2008 🏛 American Dairy Science Association 🌐 English ⚖ 251 KB

Formal and Efficient Primality Proofs by

Formal and Efficient Primality Proofs by Use of Computer Algebra Oracles

✍ Olga Caprotti; Martijn Oostdijk 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 546 KB

This paper focuses on how to use Pocklington's criterion to produce efficient formal proof-objects for showing primality of large positive numbers. First, we describe a formal development of Pocklington's criterion, done using the proof assistant Coq. Then we present an algorithm in which computer a

An efficient algorithm to compute maximu

An efficient algorithm to compute maximum entropy densities

✍ Ormoneit, D.; White, H. 📂 Article 📅 1999 🏛 Taylor and Francis Group 🌐 English ⚖ 391 KB

An Efficient Algorithm to Computing Max–

An Efficient Algorithm to Computing Max–Min Inverse Fuzzy Relation for Abductive Reasoning

✍ Chakraborty, S.; Konar, A.; Jain, L.C. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 318 KB

Computing abduction by using TMS with to

Computing abduction by using TMS with top-down expectation

✍ Noboru Iwayama; Ken Satoh 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 344 KB