Neural Logic Constraint Solving
โ
A. Monfroglio
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 588 KB
Constraint Satisfaction Problems (CSPs) play a crucial role in Artificial Intelligence and in the real world. CSPs are in general NP-hard, and a general deterministic polynomial time algorithm is not known. CSPs can be reduced in polynomial time to the Satisfaction of a Conjunctive Normal Form (CNF-