scientific article; zbMATH DE number 3657150

MaRDI QIDQ3856120zbMATH OpenFDO

Authors

Publication date 1980

Cited in

(only showing first 100 items - show all)

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
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^{*}\)
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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3856120)