Logic programming with recurrence domains-Reference-Cited by-同舟云学术

Logic programming with recurrence domains

Published:1991 Issue: Volume: Page:20-34
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Chen Hong,Hsiang Jieh

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54233-7_122.pdf

Reference14 articles.

1. M. Bruynooghe and G. Janssens. An Instance of Abstract Interpretation Integrating Type and Mode Inference. In Proc. 5 th Int. Conf. on Logic Programming, pages 669–683, K.A. Bowen and R.A. Kowalski(eds), MIT Press, Aug. 1988.

2. A. Chandra and D. Harel. Horn Clause Queries and Generalizations. J. Logic Programming, 2(1):1–16, April 1985.

3. Hong Chen and Jieh Hsiang. Logic Programming with Recurrence Domains. Technical Report 49, Department of Computer Science, SUNY at Stony Brook, Oct 1990.

4. J. Chomicki and T. Imielinski. Relational Specification of Infinite Query Answers. In Proc. of the 1989 ACM SIGMOD Int. Conf. on the Management of Data, pages 174–183, Portland, Oregon, June 1989. Vol. 18, No. 2.

5. A. Colmerauer. Prolog and Infinite Trees. In Logic Programming, Academic Press, 1982.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps;Logic, Language, Information and Computation;2007

2. The first order theory of primal grammars is decidable;Theoretical Computer Science;2004-09

3. A General Method for Using Schematizations in Automated Deduction;Automated Reasoning;2001

4. Constraints in Term Algebras (Short Survey);Algebraic Methodology and Software Technology (AMAST’93);1994

5. Primal grammars and unification modulo a binary clause;Automated Deduction — CADE-12;1994