๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Neural Logic Constraint Solving

โœ Scribed by A. Monfroglio

Book ID
102973596
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
588 KB
Volume
20
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis

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-SAT). We present here techniques for solving CNF-SAT by means of several different simulated neural networks. The results of significant tests are described. O 1994 Academic Press, Inc.

๐Ÿ“œ SIMILAR VOLUMES

ACLP: Abductive Constraint Logic Program
ACLP: Abductive Constraint Logic Programming
โœ A.C. Kakas; A. Michael; C. Mourlas ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 349 KB

This paper presents the framework of Abductive Constraint Logic Programming (ACLP), which integrates Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). In ACLP, the task of abduction is supported and enhanced by its non-trivial integration with constraint solving. This integra