scientific article

No author found.

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence (68Txx)

Related Items

Paths of least resistance in possibilistic production systems, Artificial intelligence in air combat games, Task decomposition on abstract states, for planning under nondeterminism, Weighted \(A^*\) search - unifying view and application, 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, Formal assessment of reliability specifications in embedded cyber-physical systems, Obstacle growing in a nonpolygonal world, A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment, 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, On randomization and discovery, Parallel depth first search. I: Implementation, Parallel depth first search. II: Analysis, An algorithmic approach to some problems in terrain navigation, Depth-first heuristic search for the job shop scheduling problem, Increasing search efficiency using multiple heuristics, Branch \& Sample: A simple strategy for constraint satisfaction, Exact solutions for constrained two-dimensional cutting problems, Defining answer classes using resolution refutation, R \& D decision advisor: An interactive approach to normative decision system model construction, An information roadmap method for robotic sensor path planning, Probabilistic analysis of the complexity of A*, Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces, Theory construction in psychology: The interpretation and integration of psychological data, Operations research in the space industry, On completeness of narrowing strategies, On the continuous working problem, Multiple stack branch and bound, 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, Weighted heuristic anytime search: new schemes for optimization over graphical models, Computing the throughput of concatenation state machines, Effective use of memory in iterative deepening search, Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints, Fuzzy optimal search methods, Searching for partially ordered structures, Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles, On the complexity of blocks-world planning, Semantic networks, Collaborative planning with confidentiality, LR error repair using the A* algorithm, State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning, Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems., A deductive solution for plan generation, Heuristic search through islands, Implementing a computer algebra system in Haskell, Electronic circuit diagnostic expert systems - a survey, Heuristic search in restricted memory, 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, 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, A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm, AND/OR search spaces for graphical models, Exploiting functional dependencies in declarative problem specifications, AND/OR branch-and-bound search for combinatorial optimization in graphical models, Memory intensive AND/OR search for combinatorial optimization in graphical models, The *-minimax search procedure for trees containing chance nodes, A heuristic search algorithm with modifiable estimate, General branch and bound, and its relation to \(A^*\) and \(AO^*\), 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, 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, Expert control, Unnamed Item, Modeling of complex information system based on hierarchical decision-making theory, On using learning automata for fast graph partitioning, Fuzzy logic programs as hypergraphs. Termination results, An anytime algorithm for constrained stochastic shortest path problems with deterministic policies, 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, On transformation of conditional, conformant and parallel planning to linear programming, Bandeirantes: A Graph-Based Approach for Curve Tracing and Boundary Tracking, Computing definite logic programs by partial instantiation, Planning with regression analysis in transaction logic, 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, Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms, 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, Applied heuristic optimal control, Iterative deepening multiobjective \(A^{*}\), Mechanical verification on strategies, Utility of pathmax in partial order heuristic search, PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II, Perimeter search in restricted memory, Vehicle routing in an automated warehouse: Analysis and optimization, An upper bound on the time complexity of iterative-deepening-\(A^*\), Dynamic backward reasoning systems, The statistics of state-spaces, A general heuristic bottom-up procedure for searching AND/OR graphs, Design of an atomized organization structure: a graph-theoretic approach, The ``duel expert system: Implementation of a dual approach for IBM-compatible computers., Network languages for intelligent control, Improving search efficiency using possible subgoals, Network languages for concurrent multiagent systems, Attributed relational graph matching based on the nested assignment structure, RALPH static planner: CAD-based manipulator assembly task planning for CSG-modeled objects, A deductive clustering approach, DEVS-BASED INTELLIGENT CONTROL: SPACE-ADAPTED MIXING SYSTEM EXAMPLE, Heuristic tree search with nonparametric statistical inference methods, Unnamed Item, MM: a bidirectional search algorithm that is guaranteed to meet in the middle, A logic for approximate reasoning, A probabilistic analysis of propositional STRIPS planning, 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., Models and methods for solving the problem of network vulnerability, History dependent stochastic automata: A formal view of evolutionary learning, The \(Multi\)-SAT algorithm, Entropy based test point evaluation and selection method for analog circuit fault diagnosis, LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES, Strong planning under partial observability, Finding optimal satisficing strategies for and-or trees, Minimization of Energy Losses in Electric Power Distribution Systems by Intelligent Search Strategies, Subproblem ordering heuristics for AND/OR best-first search, A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs, Iterative-deepening search with on-line tree size prediction, On game graph structure and its influence on pathology, Evaluating the impact of AND/OR search on 0-1 integer linear programming, A theoretic and practical framework for scheduling in a stochastic environment, Optimization problems involving collections of dependent objects, Joint production and transportation scheduling in flexible manufacturing systems, Causality and consistency in economic models, Conflict-free shortest-time bidirectional AGV routeing, Two-agent IDA*, Beyond associative memories: Logics and variables in connectionist models, Generating plans in linear logic. I: Actions as proofs, Directed hypergraphs and applications, Embedding Intelligent Planning Capability to DEVS Models by Goal Regression Method, Disassembly sequence generation: A Petri net based heuristic approach, Simple statistical gradient-following algorithms for connectionist reinforcement learning, Compositional convolutional neural networks: a robust and interpretable model for object recognition under occlusion, Using interpolation to improve path planning: The Field D* algorithm, Activity graphs: A language for flexible consultation systems, Foundations of explanations as model reconciliation, Low order polynomial bounds on the expected performance of local improvement algorithms, Future paths for integer programming and links to artificial intelligence, Optimal matching of deformed patterns with positional influence, Developing scheduling systems for Daewoo shipbuilding: DAS project, Artificial intelligence and human decision making, A strategy of problem solving in a fuzzy reasoning network, On the classification of discontinuities by the pattern recognition methods, THE COMPETENCE OF A MULTIPLE CONTEXT LEARNING SYSTEM, Segmentation of piecewise stationary signals, The Spatial Semantic Hierarchy, 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, A robust approach to high-speed navigation for unrehearsed desert terrain, An efficient algorithm for searching implicit AND/OR graphs with cycles, On knowledge evolution: acquisition, revision, contraction, Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization, Complexity, decidability and undecidability results for domain-independent planning, Network languages for complex systems, Distributed task assignment using critical path estimate, The inevitability of inconsistent abstract spaces, On optimizing the evaluation of a set of expressions, Video indexing and similarity retrieval by largest common subgraph detection using decision trees, An exact algorithm for the constraint satisfaction problem: Application to logical inference, Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming, Modelling and identification of manufacturing systems: decomposition stage, Generating narratives from simple action structures, Backjump-based backtracking for constraint satisfaction problems, Backward fuzzy heuristic search algorithm FBHAO\(^*\) for fuzzy general and/or graph, Hill Climbing with Multiple Local Optima, Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search, Translations of network languages