The technical problems are answered by non-procedural logical constraint-based languages like Prolog.
Abstract and PostScript version of 'Multi-Agent Planning Using an Abductive Event Calculus' in which a planning service module is incorporated into a constraint-logic framework to gain a strong sense of non-linearity.
Implementation of general Constraint Logic Programming scheme introduced by Jaffar, Michaylov 1987. As full as other CLP(R)s: solves linear equations over rational or real valued variables, and covers lazy treatment of nonlinear equations.
Post-JICSLP'96 Workshop and 1996 Compulog Net Area Meeting on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages.
Compares efficiency of 8 Constraint Logic Programming (CLP) systems in the setting of finite domains, and a specific aspect of their expressiveness: that concerning reification and meta-constraints.
Description and contact for runtime, compiler (byte-code), constraint solver; free for academic and research use.
Constraint logic programming language with the abilities of CLP(BNR) and most of those of cc(FD). Possibility to program directly in projection constraints makes Nicolog more flexible than many CLP systems. FTP site.
Free, logic-based constraint solver: C++ implementation of implicit enumeration algorithm for solving (non)linear 0-1 (or pseudo-Boolean) optimization problems with integer coefficients.
Constraint logic programming language that includes ideas from object-oriented programming and intelligent backtracking. Constraints include finite domain constraints (as in CHiP) and disjoint real interval domain constraints. FTP Site.
At Simon Fraser University, Canada. Research: artificial intelligence including constraint reasoning, heuristic search, intelligent agents. Applies such methods to applications in planning and scheduling, configuration, user-interfaces.