Publication:3856120

No author found.

Publication date: 1980

predicate calculus; production systems; natural language processing; robotics; control strategies; program synthesis; machine vision; search techniques; plan generation; decomposability of databases; intelligent data retrieval; operations performed on data structures; question-answering systems; building intelligent machines

Mathematics Subject Classification ID

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

68T05: Learning and adaptive systems in artificial intelligence

68T10: Pattern recognition, speech recognition

68-02: Research exposition (monographs, survey articles) pertaining to computer science

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68Txx: Artificial intelligence

Related Items

A deductive solution for plan generation, Heuristic search through islands, Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles, Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems., The problem reduction method under uncertainty and decomposition of functions, Parallel state-space search for a first solution with consistent linear speedups, A characterization of achievable patterns of the MN-puzzle problem, A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm, A heuristic search algorithm with modifiable estimate, General branch and bound, and its relation to \(A^*\) and \(AO^*\), SAT-based planning in complex domains: Concurrency, constraints and nondeterminism, Contingent planning under uncertainty via stochastic satisfiability, Conformant planning via symbolic model checking and heuristic search, On randomization and discovery, Defining answer classes using resolution refutation, On completeness of narrowing strategies, On the continuous working problem, Multiple stack branch and bound, The *-minimax search procedure for trees containing chance nodes, Admissible heuristic search in AND/OR graphs, Human system interface concerns in support system design, Modeling production rules by means of predicate transition networks, Ordering conjunctive queries, Perceptual organization as nested control, Depth-first iterative-deepening: An optimal admissible tree search, Inference procedures under uncertainty for the problem-reduction method, A formal model of diagnostic inference. I. Problem formulation and decomposition, A formal model of diagnostic inference. II. Algorithmic solution and application, PRIAM, an interactive program for chosing among multiple attribute alternatives, Principles of information structure common to six levels of the human cognitive system, An upper bound for the speedup of parallel best-bound branch-and-bound algorithms, Expert control, Paths of least resistance in possibilistic production systems, Artificial intelligence in air combat games, Structural analysis of local search heuristics in combinatorial optimization, A search algorithm for motion planning with six degrees of freedom, Controlling recursive inference, The hierarchical structure of graph searches, Resolution on formula-trees, Systolic processing for dynamic programming problems, Resolution vs. cutting plane solution of inference problems: Some computational experience, Statistical heuristic search, Automated analysis of operators on state tables: A technique for intelligent search, Admissibility of \(AO^ *\) when heuristics overestimate, About the Paterson-Wegman linear unification algorithm, Constraint satisfaction from a deductive viewpoint, Obstacle growing in a nonpolygonal world, Linearity and plan generation, Explanation-based generalisation \(=\) partial evaluation, Semantics of production systems, INGRID: A graph invariant manipulator, A Prolog technology theorem prover: Implementation by an extended Prolog compiler, \(BS^*:\) An admissible bidirectional staged heuristic search algorithm, Parallel depth first search. I: Implementation, Parallel depth first search. II: Analysis, An algorithmic approach to some problems in terrain navigation, Increasing search efficiency using multiple heuristics, Branch \& Sample: A simple strategy for constraint satisfaction, Exact solutions for constrained two-dimensional cutting problems, R \& D decision advisor: An interactive approach to normative decision system model construction, Probabilistic analysis of the complexity of A*, Theory construction in psychology: The interpretation and integration of psychological data, Knowledge versus search: a quantitative analysis using A*, Verisimilitude based on concept analysis, Properties of a class of trivalent network graphs and optimal routing, Bidirectional heuristic search with limited resources, Generalized best first search using single and multiple heuristics, Reduction rules for resolution-based systems, Reducing reexpansions in iterative-deepening search by controlling cutoff bounds, \(L_ 1\) shortest paths among polygonal obstacles in the plane, Robot motion planning with uncertainty in control and sensing, Effective use of memory in iterative deepening search, Fuzzy optimal search methods, Searching for partially ordered structures, On the complexity of blocks-world planning, Semantic networks, Electronic circuit diagnostic expert systems - a survey, Heuristic search in restricted memory, Inductive learning of search control rules for planning, On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning, Reaching agreements through argumentation: a logical model and implementation, Developing scheduling systems for Daewoo shipbuilding: DAS project, Artificial intelligence and human decision making, Network languages for complex systems, Distributed task assignment using critical path estimate, The inevitability of inconsistent abstract spaces, An exact algorithm for the constraint satisfaction problem: Application to logical inference, Backward fuzzy heuristic search algorithm FBHAO\(^*\) for fuzzy general and/or graph, Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search, Translations of network languages, Computing definite logic programs by partial instantiation, The case for research in decision support systems, A unified framework for explanation-based generalization of partially ordered and partially instantiated plans, Partial-order planning: Evaluating possible efficiency gains, Automatically generating abstractions for planning, The computational complexity of propositional STRIPS planning, Multi-contributor causal structures for planning: A formalization and evaluation, An overview of transaction logic, Genetic search with dynamic operating disciplines, Iterative deepening multiobjective \(A^{*}\), Applied heuristic optimal control, A deductive clustering approach, DEVS-BASED INTELLIGENT CONTROL: SPACE-ADAPTED MIXING SYSTEM EXAMPLE, A logic for approximate reasoning, Minimization of Energy Losses in Electric Power Distribution Systems by Intelligent Search Strategies, Two-agent IDA*, Embedding Intelligent Planning Capability to DEVS Models by Goal Regression Method, Disassembly sequence generation: A Petri net based heuristic approach, Low order polynomial bounds on the expected performance of local improvement algorithms, Segmentation of piecewise stationary signals, LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES, An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs, Planning as heuristic search, LAO*: A heuristic search algorithm that finds solutions with loops, The \(PN^{*}\)-search algorithm: Application to tsume-shogi, Planning and control in artificial intelligence: A unifying perspective, Model-based stroke extraction and matching for handwritten Chinese character recognition, Heuristic search strategies for multiobjective state space search, Learning for efficient search, A high-performance exact method for the resource-constrained project scheduling problem, Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search, Utility of pathmax in partial order heuristic search, Perimeter search in restricted memory, An upper bound on the time complexity of iterative-deepening-\(A^*\), The statistics of state-spaces, The ``duel expert system: Implementation of a dual approach for IBM-compatible computers., Network languages for intelligent control, Network languages for concurrent multiagent systems, Failure driven dynamic search control for partial order planners: an explanation based approach, A behavior-based architecture for autonomous underwater exploration, Permissive planning: Extending classical planning to uncertain task domains., The Spatial Semantic Hierarchy, An efficient algorithm for searching implicit AND/OR graphs with cycles, Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization, Backjump-based backtracking for constraint satisfaction problems, Beyond associative memories: Logics and variables in connectionist models, Generating plans in linear logic. I: Actions as proofs, Directed hypergraphs and applications, Simple statistical gradient-following algorithms for connectionist reinforcement learning, Activity graphs: A language for flexible consultation systems, Future paths for integer programming and links to artificial intelligence, Optimal matching of deformed patterns with positional influence, A strategy of problem solving in a fuzzy reasoning network, On the classification of discontinuities by the pattern recognition methods, A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures, A minimax algorithm better than alpha-beta? Yes and no, Pathology on game trees revisited, and an alternative to minimaxing, Complexity, decidability and undecidability results for domain-independent planning, Video indexing and similarity retrieval by largest common subgraph detection using decision trees, Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms, Mechanical verification on strategies, Vehicle routing in an automated warehouse: Analysis and optimization, Improving search efficiency using possible subgoals, The \(Multi\)-SAT algorithm, Strong planning under partial observability, Finding optimal satisficing strategies for and-or trees, Dynamic backward reasoning systems, A general heuristic bottom-up procedure for searching AND/OR graphs, Unnamed Item, On knowledge evolution: acquisition, revision, contraction, Modelling and identification of manufacturing systems: decomposition stage, Generating narratives from simple action structures, RALPH static planner: CAD-based manipulator assembly task planning for CSG-modeled objects, Heuristic tree search with nonparametric statistical inference methods, On game graph structure and its influence on pathology, Causality and consistency in economic models, Conflict-free shortest-time bidirectional AGV routeing, A robust approach to high-speed navigation for unrehearsed desert terrain, Hill Climbing with Multiple Local Optima, History dependent stochastic automata: A formal view of evolutionary learning, THE COMPETENCE OF A MULTIPLE CONTEXT LEARNING SYSTEM, On optimizing the evaluation of a set of expressions, Design of an atomized organization structure: a graph-theoretic approach