Cognitive systems with human-level intelligence must dis­play a wide range of abilities, including reasoning about the beliefs of others, hypothetical and future situations, quanti­fiers, probabilities, and counterfactuals. While each of these deals in some way with reasoning about alternative states of reality, no single knowledge representation framework deals with them in a unified and scalable manner. As a conse­quence it is difficult to build cognitive systems for domains that require each of these abilities to be used together. To enable this integration we propose a representational framework based on synchronizing beliefs between worlds. Using this framework, each of these tasks can be reformu­lated into a reasoning problem involving worlds. This demonstrates that the notions of worlds and inheritance can bring significant parsimony and broad new abilities to knowledge representation.

Many problems in AI, including planning, logical reasoning and probabilistic inference, have been shown to reduce to (weighted) constraint satisfaction. While there are a number of approaches for solving such problems, the recent gains in efficiency of the satisfiability approach have made SAT solvers a popular choice. Modern propositional SAT solvers are efficient for a wide variety of problems. However, particularly in the case of spatial reasoning, conversion to propositional SAT can sometimes result in a large number of variables and/or clauses. Moreover, spatial reasoning problems can often be more efficiently solved if the agent is able to exploit the geometric nature of space to make better choices during search and backtracking. The result of these two drawbacks — larger problem sizes and inefficient search — is that even simple spatial constraint problems are often intractable in the SAT approach. In this paper we propose a spatial reasoning system that provides significant performance improvements in constraint satisfaction problems involving spatial predicates. The key to our approach is to integrate a diagrammatic representation with a DPLL-based backtracking algorithm that is specialized for spatial reasoning. The resulting integrated system can be applied to larger and more complex problems than current approaches and can be adopted to improve performance in a variety of problems ranging from planning to probabilistic inference

Many important tasks can be cast as weighted relational satisfiability problems.  Propositionalizing relational theories and making inferences with them using SAT algorithms has proven effective in many cases.  However, these approaches require that all objects in a domain be known in advance.  Many domains, from language understanding to machine vision, involve reasoning about objects that are not known beforehand.  Theories with unknown objects can require models with infinite objects in their domain and thus lead to propositionalized SAT theories that existing algorithms cannot deal with.  To address these problems, we characterize a class of relational generative weighted satisfiability theories (GenSAT) over potentially infinite domains and propose an algorithm, GenDPLL, for finding models of these theories.  We introduce the notion of a relevant model and an increasing cost theory to identify conditions under which GenDPLL is complete, even when a theory has infinite models.

Making progress toward human-level artificial intelligence often seems to require a large number of difficult-to-integrate computational methods and enormous amounts of knowledge about the world. This article provides evidence from linguistics, cognitive psychology, and neuroscience for the cognitive substrate hypothesis that a relatively small set of properly integrated data structures and algorithms can underlie the whole range of cognition required for human-level intelligence. A natural language syntactic parser that uses only the mechanisms of an infant physical reasoning model developed in Polyscheme demonstrates that a single cognitive substrate can underlie intelligent systems in superficially very dissimilar domains. This work suggests that identifying and implementing a cognitive substrate will accelerate progress toward human-level artificial intelligence.

Making progress toward human-level artificial intelligence often seems to require a large number of difficult-to-integrate computational methods and enormous amounts of knowledge about the world. This article provides evidence from linguistics, cognitive psychology, and neuroscience for the cognitive substrate hypothesis that a relatively small set of properly integrated data structures and algorithms can underlie the whole range of cognition required for human-level intelligence. Some computational principles (embodied in the Polyscheme cognitive architecture) are proposed to solve the integration problems involved in implementing such a substrate. A natural language syntactic parser that uses only the mechanisms of an infant physical reasoning model developed in Polyscheme demonstrates that a single cognitive substrate can underlie intelligent systems in superficially very dissimilar domains. This work suggests that identifying and implementing a cognitive substrate will accelerate progress toward human-level artificial intelligence.