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

We introduce a successor model of an AND-OR tree. Leaves are connected to internal nodes via communication channels that possibly…

2015

In 2007, Liu and Tanaka showed that for any uniform binary AND-OR tree on the assignments that are independently distributed (ID…

2015

In this letter, we propose a new cross-level decoding method for LT codes, where the results of packet-level decoding are fed…

2013

Consideration was given to the problem of time verification of the combinational circuits, namely, to the problem of determining…

2013

We describe a method for creating conditional plans for controllable thermal power generators operating together with…

2003

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

2003

In this paper we take advantage of and/or tree to analyze or transform problems raised by the public and goals to be mined,and…

1997

HE CONCEPT OF SOFTWARE ARCHITECTURE has recently emerged as a new way to improve our ability to effectively construct large-scale…

1991

1991

We provide an algorithm that finds optimal search strategies for AND trees and OR trees. Our model includes three outcomes when a…