×

Generalized AND/OR graphs. (English) Zbl 0333.68063


MSC:

68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
68W99 Algorithms in computer science
68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Chang, C. L.; Slagle, J. R., An admissible and optimal algorithm for searching AND/OR graphs, Artificial Intelligence, 2, 117-128 (1971) · Zbl 0227.68016
[2] Fikes, R. E.; Nilsson, N. J., STRIPS: A new approach to the application of theorem proving to problem solving, (Proc. 2nd International Joint Conference on Artificial Intelligence (1971)), 608-620
[3] Hall, P. A.V., Equivalence between AND/OR graphs and context-free grammars, Comm. ACM, 16, 444-445 (1973) · Zbl 0268.68034
[4] Hart, P.; Nilsson, N. J.; Raphael, B., A formal basis for the heuristic determination of minimum cost paths, IEEE Trans., SCC4, 100-107 (1968)
[5] Hewitt, C., Description and theoretical analysis (using schemata) of PLANNER: A language for proving theorems and manipulating models in a robot, A1 Memo No. 251, MIT Project MAC (April 1972)
[6] Levi, G.; Sirovich, F., Some remarks on the equivalence between AND/OR graphs and context-free grammars, (IEI Internal Report B73-12 (October 1973), IEI: IEI Pisa, Italy)
[7] Levi, G.; Sirovich, F., A problem-reduction model for non-independent subproblems, (Proc. 4th International Joint Conference on Artificial Intelligence (1975)), 340-344
[8] Martelli, A.; Montanari, U., Additive AND/OR graphs, (Proc. 3rd International Joint Conference on Artificial Intelligence (1973)), 1-11
[9] Montangero, C.; Pacini, G.; Turini, F., Two-level control structures for nondeterministic programming, (Nota Interna B74-37 (October 1974), Istituto di Elaborazione della Informazione: Istituto di Elaborazione della Informazione Pisa, Italy) · Zbl 0297.68072
[10] Nilsson, N. J., Searching problem-solving and game-playing trees for minimal cost solutions, (Proc. IFIP Congress (1968)), 125-130 · Zbl 0191.17704
[11] Nilsson, N. J., Problem Solving Methods in Artificial Intelligence (1971), McGraw-Hill: McGraw-Hill New York
[12] Rulifson, J. F.; Derksen, J. A.; Waldinger, R. J., qa4, a procedural calculus for intuitive reasoning, SRI AI Center Technical Note 73 (November 1972)
[13] VanderBrug, G. J.; Minker, J., State-space, problem-reduction and theorem proving—Some relationships, Comm. ACM, 18, 107-115 (1975) · Zbl 0323.68054
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.