On the Optimal Solutions to AND/OR Series-Parallel Graphs
Journal of the ACM (JACM)
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
Formal languages and their relation to automata
Formal languages and their relation to automata
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
And/Or Programs: A New Approach to Structured Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Integrating knowledge in problem solving search procedures
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
The complexity of searching several classes of AND/OR graphs
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Recent developments in the theory of data structures
Computer Languages
Bootstrap learning via modular concept discovery
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 48.22 |
Recent research in artificial intelligence has led to AND/OR graphs as a model of problem decomposition (Nilsson [3]; Simon and Lee [4]). However, AND/OR graphs of a restricted type are equivalent to context-free grammars. This can be set-up formally (the beginnings of a formalism of AND/OR graphs is contained in [4]), but the formalism is so obvious that a brief discussion and example suffice.