Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,213,919 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Broader (1)
Artificial intelligence
List of data structures
Logic programming
Proof-number search
Tree traversal
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees
Weiguang Peng
,
NingNing Peng
,
KengMeng Ng
,
Kazuyuki Tanaka
,
Yue Yang
Information Processing Letters
2017
Corpus ID: 42779433
Highly Cited
2015
Highly Cited
2015
Model-Based Genetic Algorithms for Algorithm Configuration
C. Ansótegui
,
Y. Malitsky
,
Horst Samulowitz
,
Meinolf Sellmann
,
Kevin Tierney
International Joint Conference on Artificial…
2015
Corpus ID: 16418278
Automatic algorithm configurators are important practical tools for improving program performance measures, such as solution time…
Expand
2014
2014
Cost-Optimal Execution of Boolean Query Trees with Shared Streams
H. Casanova
,
Lipyeow Lim
,
Y. Robert
,
F. Vivien
,
Dounia Zaidouni
IEEE International Parallel and Distributed…
2014
Corpus ID: 7674039
The processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several…
Expand
2013
2013
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
Mark Bun
,
J. Thaler
International Colloquium on Automata, Languages…
2013
Corpus ID: 12252578
We establish a generic form of hardness amplification for the approximability of constant-depth Boolean circuits by polynomials…
Expand
2011
2011
Non-uniform compressive sensing
N. Rahnavard
,
A. Talari
,
Behzad Shahrasbi
Allerton Conference on Communication, Control…
2011
Corpus ID: 15667334
In this paper, we introduce non-uniform compressive sensing (NCS), a novel compressive sensing (CS) technique that enables non…
Expand
Highly Cited
2011
Highly Cited
2011
Evolving Behaviour Trees for the Mario AI Competition Using Grammatical Evolution
Diego Perez Liebana
,
Miguel Nicolau
,
M. O’Neill
,
A. Brabazon
EvoApplications
2011
Corpus ID: 7127136
This paper investigates the applicability of Genetic Programming type systems to dynamic game environments. Grammatical Evolution…
Expand
2003
2003
On the BEAM Implementation
Ricardo Lopes
,
V. S. Costa
,
Fernando M A Silva
Portuguese Conference on Artificial Intelligence
2003
Corpus ID: 16191642
Logic Programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very…
Expand
Highly Cited
1998
Highly Cited
1998
Analysis of random processes via And-Or tree evaluation
M. Luby
,
M. Mitzenmacher
,
A. Shokrollahi
ACM-SIAM Symposium on Discrete Algorithms
1998
Corpus ID: 12884104
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
R. Karp
,
Yanjun Zhang
1994
Corpus ID: 2491666
This paper studies tail bounds on supercritical branching processes with nite distributions of oospring. Given a nite…
Expand
Highly Cited
1991
Highly Cited
1991
A Practical Framework for the Abstract Interpretation of Logic Programs
M. Bruynooghe
The Journal of Logic Programming
1991
Corpus ID: 28508112
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE