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

Journal of Logic Programming

Volumn 34, Issue 3, 1998, Pages 227-259

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

^a UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAM LISTINGS; CONTEXT FREE GRAMMARS; NATURAL LANGUAGE PROCESSING SYSTEMS; PROLOG (PROGRAMMING LANGUAGE);

DEFINITE CLAUSE GRAMMAR; PARSER;

LOGIC PROGRAMMING;

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

References (35)

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