✦ LIBER ✦

Logic programming with infinite sets

✍ Scribed by Douglas Cenzer; Jeffrey B Remmel; Victor W. Marek

Publisher: Springer Netherlands
Year: 2005
Tongue: English
Weight: 399 KB
Volume: 44
Category: Article
ISSN: 1012-2443
DOI: 10.1007/s10472-005-7030-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Set based logic programming

✍ H. A. Blair; V. W. Marek; J. B. Remmel 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 480 KB

Integrating answer set programming and c

Integrating answer set programming and constraint logic programming

✍ Veena S. Mellarkod; Michael Gelfond; Yuanlin Zhang 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 659 KB

Preferred answer sets for extended logic

Preferred answer sets for extended logic programs

✍ Gerhard Brewka; Thomas Eiter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 442 KB

In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used to defi

Consistency properties and set based log

Consistency properties and set based logic programming

✍ Anil Nerode; Jeffrey B. Remmel 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 455 KB

Comments on “logic programming with equa

Comments on “logic programming with equations”

✍ Pier Giorgio Bosco; Elio Giovannetti; Corrado Moiso; Catuscia Palamidessi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 343 KB

This note discusses the results of the compilational approach of equational logic programming developed by Van Emden and Yukawa, and compares them with similar results obtained by Bosco et al. and by Fribourg. We show that Van Emden and Yukawa's completeness result contains an inaccuracy, and we sug

Ordered sets with no infinite antichains

✍ J.D. Lawson; M. Mislove; H. Priestley 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 420 KB