✦ LIBER ✦

Satisfiability on hypergraphs

✍ Scribed by Adam Kolany

Publisher: Springer Netherlands
Year: 1993
Tongue: English
Weight: 557 KB
Volume: 52
Category: Article
ISSN: 0039-3215
DOI: 10.1007/bf01057654

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of hypergraphs satisfying an ine

A class of hypergraphs satisfying an inequality of Lovász

✍ Zhang Cunquan; Li Weixuan 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 228 KB

On-line 2-satisfiability

✍ Brigitte Jaumard; Paola Marchioro; Aurora Morgana; Rossella Petreschi; Bruno Sim 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 538 KB

On Turan hypergraphs

✍ M. Lorea 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 466 KB

Let a(H) be the -,t\*rbility number of a hypergraph H = (X, a). T(n, L, ar) is the smallest 4 such that there exists :'. k-uniform hypergraph H with n vertices, 4 edges and with a(H) s Q. A k-uniform hypergraph H, with n vertices, T( n, k, cr ) edges and Q!(H) s ~1 is a Turan hypergraph. The value

On unavoidable hypergraphs

✍ F. R. K. Chung; P. Erdös 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB

Observables on hypergraphs

✍ S. P. Gudder; G. T. Rüttimann 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 834 KB

On the satisfiability of circumscription

✍ Vladimir Lifschitz 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 476 KB

Etherington, Mercer and Reiter showed, on the basis of ideas of Bossu and Siegel, that circumscription cannot lead to inconsistency for universal formulas. We extend this result in three directions: to formulas of a more general syntactic form, to circumscr~tion with some predicate symbols allowed t