ACM Home Page
Please provide us with feedback. Feedback
Implementing deductive databases by linear programming
Full text PdfPdf (927 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
San Diego, California, United States
Pages: 283 - 292  
Year of Publication: 1992
ISBN:0-89791-519-4
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 21,   Citation Count: 7
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/137097.137892
What is a DOI?

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
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
 
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


Collaborative Colleagues:
Colin Bell: colleagues
Anil Nerode: colleagues
Raymond T. Ng: colleagues
V. S. Subrahmanian: colleagues