A Logical Approach to Representing and Solving Search Problems
By David Mitchell, SFU Computer Science
I will describe an on-going project developing a logic-based theory of languages for representing combinatorial search problems, and associated implementation methods. After a brief sketch of the project, I will give a few concrete examples of work in progress at various levels: representation language design, efficient grounding techniques, and ground solver design.
Visit the LCI Forum page