✦ LIBER ✦

Completeness results for circumscription

✍ Scribed by Donald Perlis; Jack Minker

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 727 KB
Volume: 28
Category: Article
ISSN: 0004-3702
DOI: 10.1016/0004-3702(86)90029-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Circumscription: Completeness reviewed

✍ Manfred Jaeger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 433 KB

In this paper we demonstrate that some results on the completeness of P-defining theories published earlier are incorrect. We point out that by restricting the original propositions to well-founded theories results somewhat weaker than the original ones can be retained. We also present a theorem tha

Completeness results for graph isomorphi

Completeness results for graph isomorphism

✍ Birgit Jenner; Johannes Köbler; Pierre McKenzie; Jacobo Torán 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 239 KB

We prove that the graph isomorphism problem restricted to trees and to colored graphs with color multiplicities 2 and 3 is many-one complete for several complexity classes within NC 2 . In particular we show that tree isomorphism, when trees are encoded as strings, is NC 1 -hard under AC 0 -reductio

Results on translating defaults to circu

Results on translating defaults to circumscription

✍ Tomasz Imielinski 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 806 KB

Completeness Results for Recursive Data

Completeness Results for Recursive Data Bases

✍ Tirza Hirst; David Harel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 767 KB

We consider infinite recursive (i.e., computable) relational data bases. Since the set of computable queries on such data bases is not closed under even simple relational operations, one must either make do with a very modest class of queries or considerably restrict the class of allowed data bases.

Some APX-completeness results for cubic

Some APX-completeness results for cubic graphs

✍ Paola Alimonti; Viggo Kann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Four fundamental graph problems, Minimum vertex cover, Maximum independent set, Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic graphs. Therefore, unless P = NP, these problems do not admit any polynomial time approximation scheme on input graphs of degree bounded

Model completeness results for elliptic

Model completeness results for elliptic and abelian functions

✍ Ricardo Bianconi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 1005 KB