Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

And–or tree

Known as: And-or tree, And/or tree 
An and–or tree is a graphical representation of the reduction of problems (or goals) to conjunctions and disjunctions of subproblems (or subgoals).
Wikipedia

Related topics

Related topics

5 relations

Broader (1)

Artificial intelligence
List of data structuresLogic programmingProof-number searchTree traversal

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Model-Based Genetic Algorithms for Algorithm Configuration
Automatic algorithm configurators are important practical tools for improving program performance measures, such as solution time… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
2014
2014
Cost-Optimal Execution of Boolean Query Trees with Shared Streams
The processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2013
2013
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
We establish a generic form of hardness amplification for the approximability of constant-depth Boolean circuits by polynomials… Expand
  • table 1
2011
2011
Non-uniform compressive sensing
In this paper, we introduce non-uniform compressive sensing (NCS), a novel compressive sensing (CS) technique that enables non… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Highly Cited
2011
Highly Cited
2011
Evolving Behaviour Trees for the Mario AI Competition Using Grammatical Evolution
This paper investigates the applicability of Genetic Programming type systems to dynamic game environments. Grammatical Evolution… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
2008
2008
Quantum Algorithms for Evaluating Min-MaxTrees
We present a bounded-error quantum algorithm for evaluating Min - Max trees with $N^{\frac{1}{2}+o(1)}$ queries, where N is the… Expand
2003
2003
On the BEAM Implementation
Logic Programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very… Expand
2000
2000
PHYSIOGRAPHIC REGION INTERPRETATION: FORMALIZATION WITH RULE BASED STRUCTURES AND OBJECT HIERARCHIES
A conceptual scheme for the interpretation of physiographic regions, developed in an earlier effort, is formalized and programmed… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1998
Highly Cited
1998
Analysis of random processes via And-Or tree evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools… Expand
1994
1994
Finite Branching Processes and AND/OR Tree Evaluation
This paper studies tail bounds on supercritical branching processes with nite distributions of oospring. Given a nite… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE