✦ LIBER ✦

Approximability of Clausal Constraints

✍ Scribed by Peter Jonsson; Gustav Nordh

Publisher: Springer
Year: 2008
Tongue: English
Weight: 605 KB
Volume: 46
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-008-9145-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of Clausal Constraints Over C

Complexity of Clausal Constraints Over Chains

✍ Nadia Creignou; Miki Hermann; Andrei Krokhin; Gernot Salzer 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 358 KB

Approximation with interpolatory constra

Approximation with interpolatory constraints

✍ Wolfgang Warth 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Linear Approximation of Execution-Time C

Linear Approximation of Execution-Time Constraints

✍ Karl Lermer; Colin J. Fidge; Ian J. Hayes 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 342 KB

The hidden side of clausal complements

✍ Shoichi Takahashi 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 660 KB

Approximability of Dodgson’s rule

✍ John C. McCabe-Dansted; Geoffrey Pritchard; Arkadii Slinko 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 284 KB

Completely non-clausal theorem proving

✍ Neil V. Murray 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 812 KB

The proof procedure we describe operates on quantifier-free formulas of the predicate calculus which are not truth-functionally normalized in any way. The procedure involves a single inference rule called NC-resolution, and is shown to be complete. Completeness is also obtained for a simple restrict