✦ LIBER ✦

[Lecture Notes in Computer Science] STACS 93 Volume 665 || Halting problem of one binary Horn clause is undecidable

✍ Scribed by Enjalbert, P.; Finkel, A.; Wagner, K. W.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] STAC

✍ Enjalbert, P.; Finkel, A.; Wagner, K. W. 📂 Article 📅 1993 🏛 Springer Berlin Heidelberg ⚖ 632 KB

[Lecture Notes in Computer Science] STAC

✍ Monien, B.; Cori, R. 📂 Article 📅 1989 🏛 Springer Berlin Heidelberg ⚖ 682 KB

[Lecture Notes in Computer Science] Prin

✍ Dechter, Rina 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg ⚖ 124 KB