ACM Home Page
Please provide us with feedback. Feedback
Optimization and relaxation in constraint logic languages
Full text PdfPdf (1.59 MB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
St. Petersburg Beach, Florida, United States
Pages: 91 - 103  
Year of Publication: 1996
ISBN:0-89791-769-3
Authors
Kannan Govindarajan  Dept. of Computer Science, SUNY at Buffalo, Buffalo, NY
Bharat Jayaraman  Dept. of Computer Science, SUNY at Buffalo, Buffalo, NY
Surya Mantha  Corporate Research & Technology, Xerox Corporation, Webster, NY
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 24,   Citation Count: 9
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/237721.237735
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
A. Brown, S. Mantha, and T. Wakayama. Preference Logics: Towards a Unified Approach to Non- Monotonicity in Deductive Reasoning. Annals of Mathemat#cs and Artificzal Intelligence, 10:233-280, 1994.
 
3
 
4
5
 
6
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Robert A. I(owalski and Kenneth A. Bowen, editors, Proc. 5th Joint Internatio'nal Conference and Symposium on Logic Programming, pages 108t-1086, 1988.
 
7
t(. Govindarajan, B. Jayaraman, and S. Mantha. Preference Logic Grammars. Technical Report 94-27, Dept. of Computer Science, SUNY at Buffalo, 1994.
 
8
K. Govindarajan, B. Jayaraman, and S. Mantha. Preference Logic Programming. In Proc. 12th Intl. Conf. on Logic Programrn#ng, pages 731-745, 1995.
 
9
I(. Govindarajan, B. Jayaraman, and S. Ma.ntha. Relaxation in Constraint Logic Languages. Technical Report 95-22, Dept. of Computer Science, SUNY a.t Buffalo, 1995.
10
 
11
J. Jaffar and M. J. Maher. Constraint Logic Programming' A Survey. Journal of Logic Programming, 1994.
12
 
13
D. B. Kemp and P. J. Stuckey. Semantics of Logic Programs with Aggregates. In Proc. Internatzonal Logic Programming Symposium, 1991.
 
14
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy I(an, and D. B. Shmoys (eds.). The Traveling Salesman Problem: a Guided Tour of Combinatomal Optimization. Wiley and Sons, Chichester, United Kingdom, 1985.
 
15
 
16
M. J. Maher and P. J. Stuckey. Expanding Query Power in Constraint Logic Programming Languages. In E. L. Lusk and R. A. Overbeek, editors, Proc. North Amerzcan Conference on Logic Programming, pages 20-36, 1989,
 
17
18
 
19
F. C. N. Pereira and D. H. D. Warren. Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks. Artificial Intelhgence, 13:231-278, 1980.
20
 
21
 
22
23
 
24

CITED BY  9

Collaborative Colleagues:
Kannan Govindarajan: colleagues
Bharat Jayaraman: colleagues
Surya Mantha: colleagues