Synthesizing visual and action routines using constraint programming
Abstract
A diagrammatic problem-solver requires a library of visual routines (VRs) and action routines (ARs) - the VRs are used to obtain information of specified types from the diagram and ARs to modify the diagram in specified ways. The VRs/ARs required are unbounded - a new domain may call for new perceptions and actions. We report on progress on our research in building an automated VR/AR synthesis system that would take as input the definition of a new routine in terms of existing routines in the library and well-defined mathematical/logical constraints and synthesize the program for the desired routine using constraint programming. We illustrate the ideas by means of an example. © Springer-Verlag Berlin Heidelberg 2006.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Recommended Citation
Banerjee, B., & Chandrasekaran, B. (2006). Synthesizing visual and action routines using constraint programming. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 196-198. https://doi.org/10.1007/11783183_26
