Universal subgoaling and chunking: the automatic generation and learning of goal hierarchies
Universal subgoaling and chunking: the automatic generation and learning of goal hierarchies
SOAR: an architecture for general intelligence
Artificial Intelligence
The complexity of linear problems in fields
Journal of Symbolic Computation
Real quantifier elimination is doubly exponential
Journal of Symbolic Computation
Unified theories of cognition
Handbook of theoretical computer science (vol. B)
Computational Geometry: Theory and Applications
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
Relations algebras in qualitative spatial reasoning
Fundamenta Informaticae
Diagrammatic Reasoning: Cognitive and Computational Perspectives
Diagrammatic Reasoning: Cognitive and Computational Perspectives
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Logical Reasoning with Diagrams, Gerard Allwein and Jon Barwise, eds.
Journal of Logic, Language and Information
An architecture for heterogeneous reasoning
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Some Ways that Maps and Diagrams Communicate
Spatial Cognition II, Integrating Abstract Theories, Empirical Studies, Formal Methods, and Practical Applications
Reasoning about Binary Topological Relations
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
GeoRep: A Flexible Tool for Spatial Representation of Line Drawings
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combining Topological and Qualitative Size Constraints for Spatial Reasoning
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Using Orientation Information for Qualitative Spatial Reasoning
Proceedings of the International Conference GIS - From Space to Territory: Theories and Methods of Spatio-Temporal Reasoning on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space
The Mathematica Book
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
Composing cardinal direction relations
Artificial Intelligence
Efficient solving of quantified inequality constraints over the real numbers
ACM Transactions on Computational Logic (TOCL)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
The complexity of quantifier elimination and cylindrical algebraic decomposition
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Sketchpad: a man-machine graphical communication system
AFIPS '63 (Spring) Proceedings of the May 21-23, 1963, spring joint computer conference
Combining multiple heuristics online
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
A multi-engine solver for quantified boolean formulas
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A spatial search framework for executing perceptions and actions in diagrammatic reasoning
Diagrams'10 Proceedings of the 6th international conference on Diagrammatic representation and inference
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Using CBR to select solution strategies in constraint programming
ICCBR'05 Proceedings of the 6th international conference on Case-Based Reasoning Research and Development
Toward a comprehensive model of graph comprehension: making the case for spatial cognition
Diagrams'06 Proceedings of the 4th international conference on Diagrammatic Representation and Inference
Exploiting qualitative spatial neighborhoods in the situation calculus
SC'04 Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction
CLP(QS): a declarative spatial reasoning framework
COSIT'11 Proceedings of the 10th international conference on Spatial information theory
The cognitive benefits of dynamic representations in the acquisition of spatial navigation skills
Computers in Human Behavior
Hi-index | 0.00 |
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this paper is a contribution to building a general purpose DR system as an extension to a soar-like problem solving architecture. The work is in a framework in which DR is modeled as a process where subtasks are solved, as appropriate, either by inference from symbolic representations or by interaction with a diagram, i.e., perceiving specified information from a diagram or modifying/creating objects in a diagram in specified ways according to problem solving needs. The perceptions and actions in most DR systems built so far are hand-coded for the specific application, even when the rest of the system is built using the general architecture. The absence of a general framework for executing perceptions/ actions poses as a major hindrance to using them opportunistically - the essence of open-ended search in problem solving. Our goal is to develop a framework for executing a wide variety of specified perceptions and actions across tasks/domains without human intervention. We observe that the domain/task-specific visual perceptions/actions can be transformed into domain/taskindependent spatial problems. We specify a spatial problem as a quantified constraint satisfaction problem in the real domain using an open-ended vocabulary of properties, relations and actions involving three kinds of diagrammatic objects - points, curves, regions. Solving a spatial problem from this specification requires computing the equivalent simplified quantifier-free expression, the complexity of which is inherently doubly exponential. We represent objects as configuration of simple elements to facilitate decomposition of complex problems into simpler and similar subproblems. We show that, if the symbolic solution to a subproblem can be expressed concisely, quantifiers can be eliminated from spatial problems in low-order polynomial time using similar previously solved subproblems. This requires determining the similarity of two problems, the existence of a mapping between them computable in polynomial time, and designing a memory for storing previously solved problems so as to facilitate search. The efficacy of the idea is shown by time complexity analysis. We demonstrate the proposed approach by executing perceptions and actions involved in DR tasks in two army applications.