Technique for solution of constraint-satisfaction problems uses definite-clause grammars of Prolog computer language. Exploits fact that grammar-rule notation viewed as "state-change notation". Facilitates development of dynamic representation performing informed as well as blind searches. Applicable to design, scheduling, and planning problems.
Solving Constraint-Satisfaction Problems In Prolog Language
NASA Tech Briefs ; 15 , 11
1991-11-01
Miscellaneous
No indication
English
Searching Feasible Design Space by Solving Quantified Constraint Satisfaction Problems
Online Contents | 2014
|DEPICT: A high-level formal language for modeling constraint satisfaction problems
British Library Online Contents | 2008
|Application driven inverse type constraint satisfaction problems
British Library Online Contents | 2017
|Distributed constraint satisfaction problems to model railway scheduling problems
British Library Conference Proceedings | 2006
|