𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The satisfiability problem in regular CNF-formulas

✍ Scribed by F. Manyà; R. Béjar; G. Escalada-Imaz

Publisher
Springer
Year
1998
Tongue
English
Weight
319 KB
Volume
2
Category
Article
ISSN
1432-7643

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of equational problems
On the complexity of equational problems in CNF
✍ Reinhard Pichler 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Equational problems (i.e. first-order formulae with quantifier prefix ∃ \* ∀ \* , whose only predicate symbol is syntactic equality) are an important tool in many areas of automated deduction, e.g. restricting the set of ground instances of a clause via equational constraints allows the definition o