SALT: a knowledge acquisition language for propose-and-revise systems
Artificial Intelligence
A Modeling Framework for Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Partial constraint satisfaction
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Investigating Reasoning with Constraint Diagrams
Electronic Notes in Theoretical Computer Science (ENTCS)
Maintaining constraint-based applications
Proceedings of the 4th international conference on Knowledge capture
| Hi-index | 0.00 |
Constraint satisfaction is a powerful approach to solving a wide class of problems. However, as many non-experts have difficulties formulating tasks as Constraint Satisfaction Problems (CSPs), we have built a number of interfaces for particular kinds of CSPs, including crypt-arithmetic problems, map-colouring problems, and scheduling tasks, which ask highly focused questions of the user, c.f., the earlier MOLE/MORE, and SALT knowledge acquisition systems. Information from each of these interfaces is then transformed initially into a structured format which is semantic web compliant and is secondly transformed into the format required by the generic constraint satisfaction problem solver. When this problem solver is run, the user is either provided with solution(s) or feedback that the problem is underspecified (when many solutions are feasible) or over-specified (when no solution is possible). The system has 3 distinct phases, namely; information capture, transformation of the information to that used by a standard problem solver, and thirdly the solving and user feedback phase.