SLR inference: An inference system for fixed-mode logic programs, based on slr parsing

Journal of Logic Programming

Volumn 34, Issue 3, 1998, Pages

  Rosenblueth, David A ^b   Peralta, Julio C ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b IIMAS UNAM   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040532030     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(96)00076-3     Document Type: Article

References (35)

1. Abramson, H., Definite Clause Translation Grammars, in: Proc. 1984 Int. Symp. Logic Programming, Atlantic City, NJ, 1984, pp. 233-240.
2. Aho, A. V., Sethi, R., and Ullman, J. D., Compilers - Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1986.
3. Apt, K. R., Declarative Programming in Prolog, in: Proc. 1993 Int. Symp. Logic Programming, Vancouver, Canada, MIT Press, Cambridge, MA, 1993, pp. 12-35.
4. Apt, K. R. and Marchiori, E., Reasoning about Prolog Programs: From Modes through Types to Assertions, Formal Aspects Comput. 6A:743-764 (1994).
5. Ashcroft, E., Manna, Z., and Pnueli, A., Decidable Properties of Monadic Functional Schemas, J. ACM 20:489-499 (1973).
6. Clark, K. L. and van Emden, M. H., Consequence Verification of Flowcharts, IEEE Trans. Software Eng. SE-7:52-60 (1981).
7. Clark, K. L., Predicate Logic as a Computational Formalism, Technical Report 79/59, Department of Computing and Control, Imperial College, London, 1979.
8. Villemonte de la Clergerie, E. and Lang, B., LPDA: Another Look at Tabulation in Logic Programming, in: Pascal Van Hentenryck (ed.), Proc. 11th Int. Logic Programming Symp., MIT Press, Cambridge, MA, 1994, pp. 471-486.
9. Deransart, P. and Małuszyński, J., What Kind of Grammars Are Logic Programs?, in: P. Saint-Dizier and S. Szpakowicz (eds.), Logic and Logic Grammars for Language Processing, Ellis Horwood, Chichester, 1992, pp. 28-55.
10. Deransart, P. and Małuszyński, J., A Grammatical View of Logic Programming, MIT Press, Cambridge, MA, 1993.
11. Drabent, W., Do Logic Programs Resemble Programs in Conventional Languages?, in: Proc. 1987 IEEE Symp. Logic Programming, San Francisco, CA, IEEE Press, New York, 1987, pp. 389-396.
12. Engelfriet, J., Simple Program Schemes and Formal Languages, Lecture Notes in Computer Science 20, Springer-Verlag, Berlin, 1974.
13. Jones, N. D. and Madsen, M., Attibute-Influenced LR Parsing, in: Semantics Directed Compiler Generation, Lecture Notes in Computer Science 94, Springer-Verlag, Berlin, 1980, pp. 393-407.
14. Knuth, D. E., On the Translation of Languages from Left to Right. Information Control 8:607-639 (1965).
15. Knuth, D. E., Semantics of Context-Free Languages, Math. Syst. Theory 2:127-145 (1968).
16. Lang, B., Deterministic Techniques for Efficient Non-deterministic Parsers, in: J. Loeckx (ed.), Proc. 2nd Colloquium Automata, Languages and Programming, Springer-Verlag, Berlin, 1974, pp. 255-269.
17. Lang, B., Complete Evaluation of Horn Clauses: An Automata Theoretic Approach, Technical Report 913, INRIA, Rocquencourt, 1988.
18. Lang, B., Datalog Automata, in: Proc. 3rd Int. Conf. Data Knowledge Bases, 1988, pp. 389-404.
19. Lloyd, J. W., Foundations of Logic Programming, 2nd edition, Springer-Verlag, Berlin, 1987.
20. Mazurkiewicz, A., Recursive Algorithms and Formal Languages, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astr. Phys. 20:799-803 (1972).
21. Nilsson, U., AID: An Alternative Implementation of DCGs, New Generation Comput. 4:383-399 (1986).
22. Pereira, F. C. N. and Warren, D. H. D., Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks, Artif. Intell. 13:231-278 (1980).
23. Pereira, F. C. N. and Warren, D. H. D., Parsing as Deduction, in: 21st Annual Meeting Association Computational Linguistics, Cambridge, MA, Association for Computational Linguistics, 1983, pp. 137-144.
24. Rosenblueth, D. A., Fixed-Mode Logic Programs as State-Oriented Programs, Technical Report Preimpreso No. 2, IIMAS, UNAM, 1991.
25. Rosenblueth, D. A., Chart Parsers as Inference Systems for Fixed-Mode Logic Programs, New Generation Comput. 14:429-458 (1996).
26. Rosenblueth, D. A. and Peralta, J. C., LR Inference: Inference Systems for Fixed-Mode Logic Programs, Based on LR Parsing, in: Maurice Bruynooghe (ed.), Proc. Int. Logic Programming Symp., Ithaca, NY, 1994, pp. 439-453.
27. Rutledge, J. D., On Ianov's Program Schemata, J. ACM 11:1-9 (1964).
28. Sato, T. and Hisao Tamaki, H., Enumeration of Success Patterns in Logic Programs, Theoret. Comput. Sci. 34:227-240 (1984).
29. Shoenfield, J. R., Mathematical Logic, Addison-Wesley, Reading, MA, 1967.
30. Stabler, E. P., Deterministic and Bottom-Up Parsing in Prolog, in: Proc. 1st Nat. Conf. Artif. Intell., 1983, pp. 383-396.
31. Stärk, R. F., A Direct Proof for the Completeness of SLD-Resolution, in: E. Börger, H. Kleine Büning, and M. M. Richter (eds.), Computation Theory and Logic 89, Springer-Verlag, Berlin, 1990, pp. 382-383.
32. Tamaki, H. and Sato, T., Unfold/Fold Transformation of Logic Programs, in: Proc. Second Int. Logic Programming Conf., 1984, pp. 127-138.
33. Tomita, M., An Efficient Augmented-Context-Free Parsing Algorithm, Computat. Linguistics 13:31-46 (1987).
34. Uehara, K., Ochitani, R., Kakusho, O., and Toyoda, J., A Bottom-Up Parser Based on Predicate Logic: A Survey of the Formalism and Its Implementation Technique, in: Proc. 1984 Int. Symp. Logic Programming, Atlantic City, NJ, 1984, pp. 220-227.
35. Yamashita, Y. and Nakata, I., Coupled Context-Free Grammar as a Programming Paradigm, in: Proc. Int. Workshop Programming Languages Implementation Logic Programming PLILP '88, Orléans, France, 1988, pp. 132-145.