A Logical Account of Causal and Topological Maps

The Spatial Semantic Hierarchy (SSH) is a set of distinct representations for large scale space, each with its own ontology and each abstracted from the levels below it. At the control level, the agent and its environment are modeled as continuous dynamical systems whose equilibrium points are abstracted to a discrete set of distinctive states. The control laws whose execution defines trajectories linking these states are abstracted to actions, giving a discrete causal graph representation for the state space. The causal graph of states and actions is in turn abstracted to a topological network of places and paths (i.e. the topological map). Local metrical models of places and paths can be built within the framework of the control, causal and topological levels while avoiding problems of global consistency. Most of the SSH's ideas have been traditionally described in procedural terms inspired by implementations of the SSH. This description has various problems when used to implement physical agents. First, some assumptions are not explicitly stated or are difficult to meet by current sensory technology (e.g. sensory information is not rich enough to distinguish one place from another). Second, some important SSH concepts (i.e. paths) are not properly defined or understood. Third, sometimes it is not clear what the representation states and consequently it is hard to apply it to new domains. In this dissertation we propose a formal semantics for the SSH causal, topological and local metrical theories. Based on this semantics, we extend the SSH in the following important ways: (i) we include distinctive states as objects of the theory and handle perceptual aliasing, (ii) we define the models associated with the SSH causal and topological levels, (iii) we extend the SSH topological theory to handle convergent and self intersecting paths as well as hierarchical maps, (iv) we show how to combine causal, topological and noisy local metrical information, (v) based on the previous enhancements, we define an algorithm to keep track of different topological maps consistent with the agent's experiences. This algorithm supports different exploration-strategies and facilitates map disambiguation when the case arises.

[1]  Eliezer L. Lozinskii,et al.  The Good Old Davis-Putnam Procedure Helps Counting Models , 2011, J. Artif. Intell. Res..

[2]  John F. Sowa,et al.  Conceptual Structures: Information Processing in Mind and Machine , 1983 .

[3]  Bart Selman,et al.  Knowledge compilation and theory approximation , 1996, JACM.

[4]  Fabio Grandi,et al.  On Expressive Number Restrictions in Description Logics , 2001, Description Logics.

[5]  Graham Priest,et al.  Minimally inconsistent LP , 1991, Stud Logica.

[6]  Peter Jonsson,et al.  Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time , 1997, J. Artif. Intell. Res..

[7]  Fangzhen Lin,et al.  Reasoning in the Presence of Inconsistency , 1987, AAAI.

[8]  Benjamin Kuipers,et al.  A Hierarchy of Qualitative Representations for Space , 1998, Spatial Cognition.

[9]  Henry A. Kautz The Logic of Persistence , 1986, AAAI.

[10]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[11]  James F. Allen Maintaining knowledge about temporal intervals , 1983, CACM.

[12]  Journal of automated reasoning , 1986 .

[13]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[14]  Murray Shanahan Solving the frame problem - a mathematical investigation of the common sense law of inertia , 1997 .

[15]  Volker Haarslev,et al.  Consistency Testing: The RACE Experience , 2000, TABLEAUX.

[16]  Diego Calvanese,et al.  Description Logic Framework for Information Integration , 1998, KR.

[17]  Kam-Fai Wong,et al.  Belief revision and possibilistic logic for adaptive information filtering agents , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.

[18]  P. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 1999 .

[19]  Leslie Pack Kaelbling,et al.  Learning Dynamics: System Identification for Perceptually Challenged Agents , 1995, Artif. Intell..

[20]  Patrik Haslum,et al.  Some Results on the Complexity of Planning with Incomplete Information , 1999, ECP.

[21]  Benjamin Kuipers,et al.  Representing Knowledge of Large-scale Space , 1977 .

[22]  Henri Prade,et al.  Representation and combination of uncertainty with belief functions and possibility measures , 1988, Comput. Intell..

[23]  Enrico Giunchiglia,et al.  Planning as Satisfiability in Nondeterministic Domains , 2000, AAAI/IAAI.

[24]  Reid G. Simmons,et al.  Probabilistic Robot Navigation in Partially Observable Environments , 1995, IJCAI.

[25]  Dominique Longin,et al.  A Logic for Planning under Partial Observability , 2000, AAAI/IAAI.

[26]  Grigoris Antoniou,et al.  Nonmonotonic reasoning , 1997 .

[27]  Jussi Rintanen,et al.  Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

[28]  Enrico Giunchiglia,et al.  Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism , 2000, KR.

[29]  Alexander Borgida,et al.  Adding Uniqueness Constraints to Description Logics (Preliminary Report) , 1997, DOOD.

[30]  J. Taylor An Introduction to Error Analysis , 1982 .

[31]  Michael L. Littman,et al.  Initial Experiments in Stochastic Satisfiability , 1999, AAAI/IAAI.

[32]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[33]  William W. Cohen,et al.  Learning the Classic Description Logic: Theoretical and Experimental Results , 1994, KR.

[34]  Tom Duckett,et al.  Performance Comparison of Landmark Recognition Systems for Navigating Mobile Robots , 2000, AAAI/IAAI.

[35]  Andreas Goerdt,et al.  A Threshold for Unsatisfiability , 1992, MFCS.

[36]  Hector J. Levesque,et al.  The Frame Problem and Knowledge-Producing Actions , 1993, AAAI.

[37]  Robert C. Moore Reasoning About Knowledge and Action , 1977, IJCAI.

[38]  S. Decker The Semantic Web-on the respective Roles of XML and RDF , 2000 .

[39]  Wai-Kiang Yeap Towards a Computational Theory of Cognitive Maps , 1988, Artif. Intell..

[40]  Enrico Franconi,et al.  A Temporal Description Logic for Reasoning about Actions and Plans , 1998, J. Artif. Intell. Res..

[41]  Alessandro Saffiotti,et al.  A Multivalued Logic Approach to Integrating Planning and Control , 1995, Artif. Intell..

[42]  Bernhard Nebel,et al.  How Hard is it to Revise a Belief Base , 1996 .

[43]  Gadi Pinkas,et al.  Reasoning from Inconsistency: A Taxonomy of Principles for Resolving Conflict , 1992, KR.

[44]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

[45]  Robert E. Schapire,et al.  A new approach to unsupervised learning in deterministic environments , 1990 .

[46]  Sean P. Engelsontand,et al.  Maps Considered As Adaptive Planning Resources , 1992 .

[47]  Chitta Baral,et al.  Reasoning agents in dynamic domains , 2000 .

[48]  Enrico Giunchiglia,et al.  An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.

[49]  J. Monod,et al.  Recherches sur la croissance des cultures bactériennes , 1942 .

[50]  Patrick Doherty,et al.  A Reduction Result for Circumscribed Semi-Horn Formulas , 1996, Fundam. Informaticae.

[51]  Raymond Reiter,et al.  Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report , 1987, AAAI.

[52]  Marc B. Vilain,et al.  A System for Reasoning About Time , 1982, AAAI.

[53]  Benjamin Kuipers,et al.  Navigation and Mapping in Large Scale Space , 1988, AI Mag..

[54]  Drew McDermott A Theory of Metric Spatial Inference , 1980, AAAI.

[55]  Hanspeter A Mallot,et al.  Route Navigating without Place Recognition: What is Recognised in Recognition-Triggered Responses? , 2000, Perception.

[56]  Alberto Elfes,et al.  Sonar-based real-world mapping and navigation , 1987, IEEE J. Robotics Autom..

[57]  Vladimir Lifschitz,et al.  Nested Abnormality Theories , 1995, Artif. Intell..

[58]  Diego Calvanese,et al.  Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

[59]  Ilkka Niemelä,et al.  Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.

[60]  Svante Janson,et al.  Bounding the unsatisfiability threshold of random 3-SAT , 2000, Random Struct. Algorithms.

[61]  Ernest Davis,et al.  Planning routes through uncertain territory , 1983 .

[62]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[63]  L. Ahlfors Complex Analysis , 1979 .

[64]  Patrick Doherty,et al.  The PMA and relativizing change for action update , 1998 .

[65]  Bruce A. Reed,et al.  Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[66]  Benjamin Kuipers,et al.  Modeling Spatial Knowledge , 1978, IJCAI.

[67]  Marie-Odile Cordier,et al.  Prioritized Transitions for Updates , 1994, KI.

[68]  Ralf Küsters,et al.  Computing Least Common Subsumers in Description Logics with Existential Restrictions , 1999, IJCAI.

[69]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[70]  Tran Cao Son,et al.  Formalizing sensing actions A transition function based approach , 2001, Artif. Intell..

[71]  G. Neelakantan Kartha,et al.  Soundness and Completeness Theorems for Three Formalizations of Action , 1993, IJCAI.

[72]  Vladimir Lifschitz,et al.  Actions with Indirect Effects (Preliminary Report) , 1994, KR.

[73]  R. James Firby Task Networks for Controlling Continuous Processes , 1994, AIPS.

[74]  Janos Simon On some central problems in computational complexity , 1975 .

[75]  Robert C. Moore A Formal Theory of Knowledge and Action , 1984 .

[76]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[77]  J. Mackie,et al.  The cement of the universe : a study of causation , 1977 .

[78]  Mary-Anne Williams,et al.  SATEN: An Object-Oriented Web-Based Revision and Extraction Engine , 2000, ArXiv.

[79]  Verzekeren Naar Sparen,et al.  Cambridge , 1969, Humphrey Burton: In My Own Time.

[80]  Toby Walsh,et al.  Beyond NP: the QSAT phase transition , 1999, AAAI/IAAI.

[81]  Dimitris Achlioptas,et al.  Lower bounds for random 3-SAT via differential equations , 2001, Theor. Comput. Sci..

[82]  A. G. Oettinger,et al.  Language and information , 1968 .

[83]  Hector J. Levesque,et al.  Generating Hard Satisfiability Problems , 1996, Artif. Intell..

[84]  Marco Cadoli Tractable Reasoning in Artificial Intelligence , 1995, Lecture Notes in Computer Science.

[85]  Robert Schrag,et al.  Compilation for Critically Constrained Knowledge Bases , 1996, AAAI/IAAI, Vol. 1.

[86]  Pekka Orponen,et al.  Dempster's Rule of Combination is #P-Complete , 1990, Artif. Intell..

[87]  Célia da Costa Pereira,et al.  Possibilistic Planning: Representation and Complexity , 1997, ECP.

[88]  Norman Y. Foo,et al.  Dealing with the Ramification Problem in Extended Propositional Dynamic Logic , 2000, Advances in Modal Logic.

[89]  Eric Chown,et al.  Prototypes, location, and associative networks (PLAN): Towards a unified theory of cognitive mapping , 1995 .

[90]  Michael L. Littman,et al.  Probabilistic Propositional Planning: Representations and Complexity , 1997, AAAI/IAAI.

[91]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[92]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[93]  Pierre Marquis,et al.  Propositional Logic and One-Stage Decision Making , 2000, International Conference on Principles of Knowledge Representation and Reasoning.

[94]  Ernest Davis,et al.  The Mercator Representation of Spatial Knowledge , 1983, IJCAI.

[95]  Diego Calvanese,et al.  Structured Objects: Modeling and Reasoning , 1995, DOOD.

[96]  Harald Ganzinger,et al.  A superposition decision procedure for the guarded fragment with equality , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[97]  Liqiang Feng,et al.  Navigating Mobile Robots: Systems and Techniques , 1996 .

[98]  Pierfrancesco Bellini,et al.  Temporal logics for real-time system specification , 2000, CSUR.

[99]  Leslie Pack Kaelbling,et al.  Learning Topological Maps with Weak Local Odometric Information , 1997, IJCAI.

[100]  Armando Tacchella,et al.  Getting to the airport: the oldest planning problem in AI , 2000 .

[101]  B. Kuipers,et al.  Boundary Region Relations , 1998 .

[102]  Udo Hahn,et al.  Part-Whole Reasoning: A Case Study in Medical Ontology Engineering , 1999, IEEE Intell. Syst..

[103]  Ron Shamir,et al.  Complexity and algorithms for reasoning about time: a graph-theoretic approach , 1993, JACM.

[104]  Valentin Goranko,et al.  Using the Universal Modality: Gains and Questions , 1992, J. Log. Comput..

[105]  Hector J. Levesque A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases , 1998, KR.

[106]  N. Wormald Differential Equations for Random Processes and Random Graphs , 1995 .

[107]  Benjamin Kuipers,et al.  Comprehending Complex Behavior Graphs through Abstraction , 1996 .

[108]  Murray Shanahan,et al.  Noise and the Common Sense Informatic Situation for a Mobile Robot , 1996, AAAI/IAAI, Vol. 2.

[109]  E. Sandewall Features and fluents (vol. 1): the representation of knowledge about dynamical systems , 1995 .

[110]  A T McCray,et al.  The Representation of Meaning in the UMLS , 1995, Methods of Information in Medicine.

[111]  Reid G. Simmons,et al.  Passive Distance Learning for Robot Navigation , 1996, ICML.

[112]  Ian Horrocks,et al.  Optimising Tableaux Decision Procedures For Description Logics , 1997 .

[113]  Rohit Parikh,et al.  An Inconsistency Tolerant Model for Belief Representation and Belief Revision , 1999, IJCAI.

[114]  A. Peressini,et al.  The Mathematics Of Nonlinear Programming , 1988 .

[115]  Tom Bylander,et al.  A Probabilistic Analysis of Propositional STRIPS Planning , 1996, Artif. Intell..

[116]  Hanspeter A. Mallot,et al.  The Role of Global and Local Landmarks in Virtual Environment Navigation , 2000, Presence Teleoperators Virtual Environ..

[117]  Illah R. Nourbakhsh,et al.  Assumptive planning and execution: A simple, working robot architecture , 1996, Auton. Robots.

[118]  Bernhard Nebel,et al.  Terminological Reasoning is Inherently Intractable , 1990, Artif. Intell..

[119]  Sheila A. McIlraith Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes) , 2000, Artif. Intell..

[120]  Michael Jenkin,et al.  Robotic exploration as graph construction , 1991, IEEE Trans. Robotics Autom..

[121]  R. Goldblatt Logics of Time and Computation , 1987 .

[122]  J. McCarthy ELABORATION TOLERANCE , 1997 .

[123]  J. Proudfoot,et al.  Noise , 1931, The Indian medical gazette.

[124]  Benjamin C. Kuo,et al.  AUTOMATIC CONTROL SYSTEMS , 1962, Universum:Technical sciences.

[125]  Alexander Borgida,et al.  Description Logics in Data Management , 1995, IEEE Trans. Knowl. Data Eng..

[126]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[127]  Ian Horrocks,et al.  OIL in a Nutshell , 2000, EKAW.

[128]  Henry A. Kautz,et al.  Constraint propagation algorithms for temporal reasoning: a revised report , 1989 .

[129]  Ian Horrocks,et al.  Reasoning with Axioms: Theory and Practice , 2000, KR.

[130]  J. Kellett London , 1914, The Hospital.

[131]  Mukesh Dalal Anytime Families of Tractable Propositional Reasoners Introduction , .

[132]  Drew McDermott,et al.  Error correction in mobile robot map learning , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[133]  Chitta Baral,et al.  Reasoning About Effects of Concurrent Actions , 1997, J. Log. Program..

[134]  Ralph B. Winn The Nature of Causation , 1940, Philosophy of Science.

[135]  Daniel Hernández,et al.  Qualitative Representation of Spatial Knowledge , 1994, Lecture Notes in Computer Science.

[136]  Benjamin Kuipers,et al.  Spatial semantic hierarchy for a physical mobile robot , 1996 .

[137]  Volker Haarslev,et al.  Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles , 2000, KR.

[138]  Bernhard Schölkopf,et al.  Learning View Graphs for Robot Navigation , 1997, AGENTS '97.

[139]  Marco Schaerf,et al.  Tractable Reasoning via Approximation , 1995, Artif. Intell..

[140]  Hector J. Levesque,et al.  A Logic of Implicit and Explicit Belief , 1984, AAAI.

[141]  Hugh F. Durrant-Whyte Uncertain geometry in robotics , 1988, IEEE J. Robotics Autom..

[142]  Jurgen Vandorpe,et al.  Exact dynamic map building for a mobile robot using geometrical primitives produced by a 2D range finder , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[143]  David Leiser,et al.  The Traveller , 1989 .

[144]  Sebastian Thrun,et al.  Learning Metric-Topological Maps for Indoor Mobile Robot Navigation , 1998, Artif. Intell..

[145]  Dan Roth,et al.  Learning to reason , 1994, JACM.

[146]  Michael Thielscher,et al.  Ramification and Causality , 1997, Artif. Intell..

[147]  Drew McDermott,et al.  Planning Routes Through Uncertain Territory , 1983, Artif. Intell..

[148]  Dimitris Achlioptas,et al.  Optimal myopic algorithms for random 3-SAT , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[149]  Hector Geffner,et al.  Default reasoning - causal and conditional theories , 1992 .

[150]  Arthur B. Markman,et al.  Knowledge Representation , 1998 .

[151]  Enrico Giunchiglia,et al.  Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..

[152]  Ming-Te Chao,et al.  Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem , 1986, SIAM J. Comput..

[153]  Benjamin Kuipers,et al.  Algernon—a tractable system for knowledge-representation , 1991, SGAR.

[154]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[155]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.

[156]  D. E. Contois Kinetics of bacterial growth: relationship between population density and specific growth rate of continuous cultures. , 1959, Journal of general microbiology.

[157]  David E. Smith,et al.  Reasoning About Action I: A Possible Worlds Approach , 1987, Artif. Intell..

[158]  Juan Antonio Fernandez Madrigal,et al.  A general world representation for mobile robot operations , 1997 .

[159]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[160]  Peter Struss,et al.  Qualitative Reasoning , 1997, The Computer Science and Engineering Handbook.

[161]  Didier Dubois,et al.  Inconsistency Management and Prioritized Syntax-Based Entailment , 1993, IJCAI.

[162]  Vladimir Lifschitz,et al.  Answer Set Planning (Abstract) , 1999, LPNMR.

[163]  Daniel Marcu,et al.  A Logical Approach to High-Level Robot Programming A Progress Report* , 1994 .

[164]  Mark H. Bickhard,et al.  Foundational issues in artificial intelligence and cognitive science - impasse and solution , 1995, Advances in psychology.

[165]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[166]  Benjamin Kuipers,et al.  Formalizing Regions in the Spatial Semantic Hierarchy: An AH-Graphs Implementation Approach , 1999, COSIT.

[167]  Michael L. Littman,et al.  The Computational Complexity of Probabilistic Planning , 1998, J. Artif. Intell. Res..

[168]  Bernhard Schölkopf,et al.  View-Based Cognitive Mapping and Path Planning , 1995, Adapt. Behav..

[169]  Terence R. Smith,et al.  Human Way-Finding in an Urban Environment: A Performance Analysis of a Computational Process Model , 1990 .

[170]  Neil Gershenfeld,et al.  The nature of mathematical modeling , 1998 .

[171]  Bernhard Nebel,et al.  An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On , 1992, KR.

[172]  Volker Haarslev,et al.  A Concept Language with Role-Forming Predicate Restrictions , 1998 .

[173]  Franz Baader,et al.  A Scheme for Integrating Concrete Domains into Concept Languages , 1991, IJCAI.

[174]  Stefan Schulz,et al.  Knowledge Engineering by Large-Scale Knowledge Reuse - Experience from the Medical Domain , 2000, KR.

[175]  Howie Choset,et al.  Sensor based planning: a control law for generating the generalized Voronoi graph , 1997, 1997 8th International Conference on Advanced Robotics. Proceedings. ICAR'97.

[176]  Erann Gat,et al.  ESL: a language for supporting robust plan execution in embedded autonomous agents , 1997, 1997 IEEE Aerospace Conference.

[177]  Hector Geffner,et al.  A Qualitative Model for Temporal Reasoning with Incomplete Information , 1996, AAAI/IAAI, Vol. 2.

[178]  Salem Benferhat Computing Specificity in Default Reasoning , 2000 .

[179]  Andrzej Szałas,et al.  ELIMINATION OF PREDICATE QUANTIFIERS , 1999 .

[180]  Illah R. Nourbakhsh,et al.  DERVISH - An Office-Navigating Robot , 1995, AI Mag..

[181]  Benjamin Kuipers,et al.  Towards a Theory of Access-limited Logic for Knowledge Representation , 2005 .

[182]  Charles Elkan,et al.  On Solving the Qualification Problem , 1995 .

[183]  Maurizio Lenzerini,et al.  PDL-based framework for reasoning about actions , 1995, AI*IA.

[184]  Deborah L. McGuinness,et al.  Matching in Description Logics , 1999, J. Log. Comput..

[185]  Ian Horrocks,et al.  Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.

[186]  H. F. Durrant-White Consistent integration and propagation of disparate sensor observations , 1987 .

[187]  Peter Jonsson,et al.  Twenty-One Large Tractable Subclasses of Allen's Algebra , 1997, Artif. Intell..

[188]  Wolfram Burgard,et al.  Integrating Topological and Metric Maps for Mobile Robot Navigation: A Statistical Approach , 1998, AAAI/IAAI.

[189]  Hirofumi Katsuno,et al.  Propositional Knowledge Base Revision and Minimal Change , 1991, Artif. Intell..

[190]  Hector J. Levesque,et al.  Reasoning about Concurrent Execution Prioritized Interrupts, and Exogenous Actions in the Situation Calculus , 1997, IJCAI.

[191]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[192]  Benjamin Kuipers,et al.  The Spatial Semantic Hierarchy , 2000, Artif. Intell..

[193]  David Toman,et al.  On Decidability and Complexity of Description Logics with Uniqueness Constraints , 2001, Description Logics.

[194]  Michael O'Neill A biologically based model of spatial cognition and wayfinding , 1991 .

[195]  Yoram Koren,et al.  The vector field histogram-fast obstacle avoidance for mobile robots , 1991, IEEE Trans. Robotics Autom..

[196]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[197]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[198]  Arthur Gelb,et al.  Applied Optimal Estimation , 1974 .

[199]  Raja Chatila,et al.  Stochastic multisensory data fusion for mobile robot location and environment modeling , 1989 .

[200]  Jorge Lobo,et al.  Adding Knowledge to the Action Description Language A , 1997, AAAI/IAAI.

[201]  Albert C. Stevens,et al.  Distortions in judged spatial relations , 1978, Cognitive Psychology.

[202]  Marco Schaerf,et al.  Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae , 1997, AI*IA.

[203]  Murray Shanahan,et al.  Reinventing Shakey , 2001 .

[204]  Benjamin Kuipers,et al.  Qualitative and Quantitative Simulation: Bridging the Gap , 1997, Artif. Intell..

[205]  Ulrike Sattler,et al.  Terminological knowledge representation systems in a process engineering application , 1998 .

[206]  Alexander Borgida,et al.  Computing Least Common Subsumers in Description Logics , 1992, AAAI.

[207]  F. J. Pelletier,et al.  316 Notre Dame Journal of Formal Logic , 1982 .

[208]  Roberto J. Bayardo,et al.  Counting Models Using Connected Components , 2000, AAAI/IAAI.

[209]  Ian Horrocks,et al.  A Description Logic with Transitive and Inverse Roles and Role Hierarchies , 1999, J. Log. Comput..

[210]  Sandro Macchietto,et al.  The optimal design of dynamic experiments , 1989 .

[211]  James M. Crawford,et al.  A Non-Deterministic Semantics for Tractable Inference , 1998, AAAI/IAAI.

[212]  Paolo Liberatore,et al.  The Complexity of Belief Update , 1997, IJCAI.

[213]  Emilio Remolina and Benjamin Kuipers Towards a formalization of the spatial semantic hierarchy , 1998 .

[214]  Hudson Turner,et al.  Satisfiability planning with Causal Theories , 1998, KR.

[215]  Patrick Doherty,et al.  General Domain Circumscription and its Effective Reductions , 1998, Fundam. Informaticae.

[216]  Christian Freksa,et al.  Using Orientation Information for Qualitative Spatial Reasoning , 1992, Spatio-Temporal Reasoning.

[217]  Dana Angluin,et al.  On Counting Problems and the Polynomial-Time Hierarchy , 1980, Theor. Comput. Sci..

[218]  S S Stevens,et al.  On the Theory of Scales of Measurement. , 1946, Science.

[219]  Hector J. Levesque,et al.  Reasoning about Noisy Sensors and Effectors in the Situation Calculus , 1995, Artif. Intell..

[220]  DANA ANGLUIN,et al.  On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..

[221]  Judith Meyer,et al.  Nitrogen-limited growth of marine phytoplankton—I. changes in population characteristics with steady-state growth rate , 1972 .

[222]  Alvaro del Val Tractable Databases: How to Make Propositional Unit Resolution Complete Through Compilation , 1994, KR.

[223]  Rina Dechter,et al.  Directional Resolution: The Davis-Putnam Procedure, Revisited , 1994, KR.

[224]  Joachim Hertzberg,et al.  How to do Things with Worlds: On Formalizing Actions and Plans , 1993, J. Log. Comput..

[225]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[226]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indirect Effects of Actions , 1995, IJCAI.

[227]  Volker Haarslev,et al.  Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics , 2001, IJCAR.

[228]  Wolfgang Marquardt,et al.  Rome: A repository to support the integration of models over the lifecycle of model-based engineering processes , 2000 .

[229]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[230]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[231]  Günter Neumann,et al.  An Information Extraction Core System for Real World German Text Processing , 1997, ANLP.

[232]  James R. Levenick NAPS: a Connectionist Implementation of Cognitive Maps , 1991 .

[233]  Keiji Nagatani,et al.  Topological simultaneous localization and mapping (SLAM): toward exact localization without explicit localization , 2001, IEEE Trans. Robotics Autom..

[234]  Tod S. Levitt,et al.  Qualitative Navigation for Mobile Robots , 1990, Artif. Intell..

[235]  Seinosuke Toda On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[236]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[237]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[238]  Andreas Herzig,et al.  Formalizing Action and Change in Modal Logic I: the frame problem , 1999, J. Log. Comput..

[239]  Peter Jonsson,et al.  A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations , 1998, Artif. Intell..

[240]  Luis Fariñas del Cerro,et al.  Modal Tableaux with Propagation Rules and Structural Rules , 1997, Fundam. Informaticae.

[241]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[242]  Benjamin Kuipers,et al.  A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations , 1991, Robotics Auton. Syst..

[243]  Francesco M. Donini,et al.  Comparing Space Efficiency of Propositional Knowledge Representation Formalisms , 1996, KR.

[244]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[245]  Yan Zhang,et al.  Monotonicity in Rule Based Update , 1999, ICLP.

[246]  Maarten Marx,et al.  The Computational Complexity of Hybrid Temporal Logics , 2000, Log. J. IGPL.

[247]  Marco Cadoli,et al.  A Survey on Knowledge Compilation , 1997, AI Commun..

[248]  R. Klatzky,et al.  Navigator: A psychologically based model of environmental learning through navigation , 1989 .

[249]  W. J. Studden,et al.  Theory Of Optimal Experiments , 1972 .

[250]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[251]  Peter Cheeseman,et al.  On the Representation and Estimation of Spatial Uncertainty , 1986 .

[252]  Franz Baader,et al.  Tableau Algorithms for Description Logics , 2000, TABLEAUX.

[253]  J. McCarthy,et al.  Formalizing Context (Expanded Notes) , 1994 .

[254]  Ola Angelsmark,et al.  Some Observations on Durations, Scheduling and Allen's Algebra , 2000, CP.

[255]  David Kortenkamp,et al.  Prototypes, Location, and Associative Networks (PLAN): Towards a Unified Theory of Cognitive Mapping , 1995, Cogn. Sci..

[256]  Graham Priest,et al.  Reasoning About Truth , 1989, Artif. Intell..

[257]  Erik Sandewall Logic-Based Modelling of Goal-Directed Behavior , 1997, Electron. Trans. Artif. Intell..

[258]  Hudson Turner,et al.  A Causal Theory of Ramifications and Qualifications , 1995, IJCAI.

[259]  Vladimir Lifschitz,et al.  Formal Theories of Action (Preliminary Report) , 1987, IJCAI.

[260]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[261]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[262]  Murray Shanahan Noise, Non-Determinism and Spatial Uncertainty , 1997, AAAI/IAAI.

[263]  Vladik Kreinovich,et al.  Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.

[264]  Asunción Gómez-Pérez,et al.  Evaluating Knowledge Representation and Reasoning Capabilites of Ontology Specification Languages , 2000 .

[265]  O Bernard,et al.  Transient behavior of biological loop models with application to the Droop model. , 1995, Mathematical biosciences.

[266]  Andreas Herzig,et al.  Propositional Belief Base Update and Minimal Change , 1999, Artif. Intell..

[267]  Kostas J. Kyriakopoulos,et al.  Simultaneous localization and map building for mobile robot navigation , 1999, IEEE Robotics Autom. Mag..

[268]  B. Kuipers,et al.  The Semantic Hierarchy in Robot Learning , 1992 .

[269]  Armando Tacchella,et al.  A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics , 2000, TABLEAUX.

[270]  Laura Giordano,et al.  Ramification and causality in a modal action logic , 2000, J. Log. Comput..

[271]  Erik Sandewall Towards the Validation of High-Level Action Descriptions from Their Low-Level Definitions , 1996, AI Commun..