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).

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2014

Almost all current automatic service composition (ASC) algorithms consider only single nonfunctional requirements, namely quality…

2011

In this paper, we introduce non-uniform compressive sensing (NCS), a novel compressive sensing (CS) technique that enables non…

2003

Logic Programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very…

2002

Many tasks require evaluating a specified boolean expression φ over a set of probabilistic tests where we know the probability…

2000

A conceptual scheme for the interpretation of physiographic regions, developed in an earlier effort, is formalized and programmed…

2000

1994

This paper studies tail bounds on supercritical branching processes with nite distributions of oospring. Given a nite…

1991

1989

Based on a number of sample systems of varying complexity, this book illustrates the practical aspects of developing expert…