And-or tree is a term used in computer science to describe a type of decision tree that is used to represent logical expressions. It is a tree-like structure where each node represents a logical operator such as and, or, or not, and each leaf node represents a condition. And-or trees are used in fields such as artificial intelligence, expert systems, and natural language processing. Synonyms for the term and-or tree include logical tree, decision tree, binary tree, multi-way tree, and expression tree. These terms are used interchangeably to describe the same type of algorithmic structure used to represent logical expressions.