We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
In problem solving a goal/subgoal is either solved by generating needed information from current information, or further decomposed into additional subgoals. In traditional problem...
B. Chandrasekaran, Unmesh Kurup, Bonny Banerjee, J...
Query graphs with cuts are inspired by Sowa’s conceptual graphs, which are in turn based on Peirce’s existential graphs. In my thesis ‘The Logic System of Concept Graphs with...
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
Trust is a necessary concept to realize the Semantic Web. But how can we build a “Web of Trust”? We first argue that a small “Web of Trust” for each community is very esse...