TOP-DOWN SYNTHESIS OF DIVIDE-AND-CONQUER ALGORITHMS

被引：50

作者：

SMITH, DR

机构：

[1] Kestrel Inst, Palo Alto, CA, USA, Kestrel Inst, Palo Alto, CA, USA

来源：

ARTIFICIAL INTELLIGENCE | 1985年 / 27卷 / 01期

关键词：

I would like to thank an anonymous referee for numerous constructive comments. This research was supported in part by the Foundation Research Program of the Naval Postgraduate School with funds provided by the Chief of Naval Research and in part by the Office of Naval Research under Contract N00014-84-C-0473;

D O I：

10.1016/0004-3702(85)90083-9

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：43 / 96

页数：54

共 28 条

[11]

DERSHOWITZ N, 1975, JUL P C IRIA PROV IM

[12]

FOLLETT R, 1980, SEP P INT WORKSH PRO

[13]

Gerhart S. L., 1976, IEEE Transactions on Software Engineering, VSE-2, P285, DOI 10.1109/TSE.1976.233834

[14]

GERHART SL, 1975, APR P INT C REL SOFT, P88

[15] PROGRAM SYNTHESIS KNOWLEDGE [J].

GREEN, C ;

BARSTOW, D .

ARTIFICIAL INTELLIGENCE, 1978, 10 (03) :241-279

[16]

GREEN C, 1983, RADCTR83195 ROM AIR

[17]

GREEN CC, 1969, 1ST P INT JOINT C AR

[18]

LAASER WT, 1979, THESIS STANFORD U ST

[19] SYNTHESIS - DREAMS -]PROGRAMS [J].

MANNA, Z ;

WALDINGER, R .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1979, 5 (04) :294-328

[20]

Manna Z., 1980, ACM Transactions on Programming Languages and Systems, V2, P90, DOI 10.1145/357084.357090

← 1 2 3 →