|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Francois Bancilhon , David Maier , Yehoshua Sagiv , Jeffrey D Ullman, Magic sets and other strange ways to implement logic programs (extended abstract), Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.1-15, March 24-26, 1986, Cambridge, Massachusetts, United States
[doi> 10.1145/6012.15399]
|
 |
2
|
|
 |
3
|
|
| |
4
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
F. Hillier and G. Lieberman. (1974) Operations Research, Holden-Day.
|
| |
8
|
J. Hooker and C. Fedjki. (1990) Branch-and.Cut Solution of Inference Problems in Propositional Logic, Annals of Mathematics and Artificial intelligence, pp 123-139.
|
 |
9
|
|
| |
10
|
|
 |
11
|
Paris C. Kanellakis , Gabriel M. Kuper , Peter Z. Revesz, Constraint query languages (preliminary report), Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.299-313, April 02-04, 1990, Nashville, Tennessee, United States
[doi> 10.1145/298514.298582]
|
| |
12
|
L. G. Khachian. (1979) A Polynomial Algorithm for Linear Programming, Doklady Akad. Nauk USSR 224, pp 1093-1096. Translated in Soviet Math Doklady, 20, pp. 191-194.
|
| |
13
|
M. Maher. (1991) Personal electronic mail message, July 29, 1991.
|
| |
14
|
|
| |
15
|
|
| |
16
|
|
 |
17
|
|
 |
18
|
|
 |
19
|
|
 |
20
|
|
|