Skip to search formSkip to main contentSkip to account menu

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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Almost all current automatic service composition (ASC) algorithms consider only single nonfunctional requirements, namely quality… 
2012
2012
This paper proposes a simple yet effective method to learn the hierarchical object shape model consisting of local contour… 
2011
2011
In this paper, we introduce non-uniform compressive sensing (NCS), a novel compressive sensing (CS) technique that enables non… 
2003
2003
Logic Programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very… 
2000
2000
A conceptual scheme for the interpretation of physiographic regions, developed in an earlier effort, is formalized and programmed… 
1991
1991
We provide an algorithm that finds optimal search strategies for AND trees and OR trees. Our model includes three outcomes when a…