The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Prolog and Natural Language Analysis
Abstract
From the Publisher: A concise and practical introduction to logic programming and the logic-programming language Prolog, both as vehicles for understanding elementary computational linguistics and as tools for implementing the basic components of natural-language-processing systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
Constraints on variables in syntax
Ross, J. R. (1967) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 4,102
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
Understanding natural language
Winograd, T. (1972) · Cognitive Psychology · doi:10.1016/0010-0285(72)90002-3 · Cited by 2,799
Three models for the description of language
Chomsky, N. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056813 · Cited by 2,796
Backus, J. (1978) · Communications of the ACM · doi:10.1145/359576.359579 · Cited by 2,609
Clocksin, W. F., & Mellish, C. (1984) · Springer eBooks · doi:10.1007/978-3-642-55481-0 · Cited by 2,047
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
Generalized Phrase Structure Grammar.
Soames, S., Gazdar, G., Klein, E., Pullum, G., & Sag, I. (1989) · The Philosophical Review · doi:10.2307/2185122 · Cited by 1,829
An efficient context-free parsing algorithm
Earley, J. (1983) · Communications of the ACM · doi:10.1145/357980.358005 · Cited by 1,606
Depth-first iterative-deepening
Korf, R. E. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90084-0 · Cited by 1,562
The Semantics of Predicate Logic as a Programming Language
Van Emden, M. H., & Kowalski, R. A. (1976) · Journal of the ACM · doi:10.1145/321978.321991 · Cited by 1,449
Structure and Interpretation of Computer Programs
Abelson, H., Sussman, G. J., & Sussman, J. (1985) · Cited by 1,435
The Theory of Parsing, Translation, and Compiling
Aho, A. V., & Ullman, J. D. (1972) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,395
Transition network grammars for natural language analysis
Woods, W. A. (1970) · Communications of the ACM · doi:10.1145/355598.362773 · Cited by 1,323
A Transformation System for Developing Recursive Programs
Burstall, R. M., & Darlington, J. (1977) · Journal of the ACM · doi:10.1145/321992.321996 · Cited by 1,300
Introduction to formal language theory
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90068-5 · Cited by 1,254
Kowalski, R., & Smoliar, S. (1982) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1005937.1005947 · Cited by 1,182
Sterling, L., Shapiro, E., & Garrett, R. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307074 · Cited by 1,101
Introduction to Montague Semantics
Dowty, D. R., Wall, R. E., & Peters, S. (1980) · Studies in Linguistics and Philosophy · doi:10.1007/978-94-009-9065-4 · Cited by 1,097
Pereira, F. C. N., & Warren, D. H. D. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90003-x · Cited by 978
Self-citationWord concepts: A theory and simulation of some basic semantic capabilities
Quillian, M. R. (1967) · Behavioral Science · doi:10.1002/bs.3830120511 · Cited by 778
Equations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
Contributions to the Theory of Logic Programming
Apt, K. R., & van Emden, M. H. (1982) · Journal of the ACM · doi:10.1145/322326.322339 · Cited by 585
Unbounded Dependencies and Coordinate Structure
Gazdar, G. (1981) · Studies in Linguistics and Philosophy · doi:10.1007/978-94-009-3401-6_8 · Cited by 527
Bar‐Hillel, Y. (1964) · International Linear Collider · Cited by 463
Yasuhara, M. (1988) · Journal of Symbolic Logic · doi:10.2307/2274454 · Cited by 448
Linear Resolution with Selection Function
Kowalski, R., & Kuehner, D. (1983) · Automation of Reasoning · doi:10.1007/978-3-642-81955-1_32 · Cited by 316
Unfold/fold Transformation of Logic Programs
Tamaki, H., & Sato, T. (1984) · Cited by 306
An efficient easily adaptable system for interpreting natural language queries
Warren, D. H. D., & Pereira, F. C. N. (1982) · doi:10.5555/972942.972944 · Cited by 275
Self-citationTEAM: An experiment in the design of transportable natural-language interfaces
Grosz, B. J., Appelt, D. E., Martin, P. A., & Pereira, F. C. N. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90011-7 · Cited by 264
Self-citationA polymorphic type system for prolog
Mycroft, A., & O'Keefe, R. A. (1984) · Artificial Intelligence · doi:10.1016/0004-3702(84)90017-1 · Cited by 255
Ades, A. E., & Steedman, M. J. (1982) · Linguistics and Philosophy · doi:10.1007/bf00360804 · Cited by 246
Prolog - the language and its implementation compared with Lisp
Warren, D. H. D., Pereira, L. M., & Pereira, F. (1977) · Proceedings of the 1977 symposium on Artificial intelligence and programming languages - · doi:10.1145/800228.806939 · Cited by 241
Self-citationGallier, J. H. (1985) · Cited by 217
Auxiliaries and Related Phenomena in a Restrictive Theory of Grammar
Gazdar, G. J. M., Pullum, G. K., & Sag, I. A. (1982) · Language · doi:10.2307/413850 · Cited by 210
An Improved Context-Free Recognizer
Graham, S. L., Harrison, M. A., & Ruzzo, W. L. (1980) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357103.357112 · Cited by 206
Negation and Control in Prolog
Naish, L. (1986) · Springer eBooks · doi:10.1007/bfb0021681 · Cited by 170
(1982) · OLAC - Open Language Archives Community · Cited by 140
Some global optimizations for a PROLOG compiler
Mellish, C. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90004-4 · Cited by 136
Hogger, C. J. (1981) · Journal of the ACM · doi:10.1145/322248.322258 · Cited by 128
An algorithm for generating quantifier scopings
Hobbs, J. R., & Shieber, S. M. (1987) · Cited by 128
Self-citationTowards a Theory of Types in Prolog.
Mishra, P. (1984) · SLP · Cited by 115
Partial Evaluation of Prolog Programs and its Application to Meta Programming.
Takeuchi, A., & Furukawa, K. (1986) · IFIP Congress · Cited by 110
A semantics-based framework for the abstract interpretation of Prolog
Jones, N., & Søndergaard, H. (1987) · Cited by 101
Tärnlund, S.-Å. (1977) · BIT · doi:10.1007/bf01932293 · Cited by 98
A First Order Theory of Data and Programs.
Clark, K., & Tärnlund, S.-Å. (1977) · IFIP Congress · Cited by 88
Completeness of the negation as failure rule
Jaffar, J., Lassez, J.-L., & Lloyd, J. W. (1983) · Cited by 87
On memory limitations in natural language processing
Church, K. (1982) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 79
Alternation and the computational complexity of logic programs
Shapiro, E. Y. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90021-9 · Cited by 60
Some uses of higher-order logic in computational linguistics
Miller, D. A., & Nadathur, G. (1986) · Proceedings of the 24th annual meeting on Association for Computational Linguistics - · doi:10.3115/981131.981165 · Cited by 58
An analysis of consecutively bounded depth-first search with applications in automated deduction
Stickel, M. E., & Tyson, W. M. (1985) · International Joint Conference on Artificial Intelligence · Cited by 58
The generalized completeness of Horn predicate-logic as a programming language.
Andréka, H., & Németi, I. (1978) · Acta Cybernetica · Cited by 57
Treating coordination in logic grammars
Dahl, V., & McCord, M. C. (1983) · Cited by 49
Predicate logic: a calculus for deriving programs
Clark, K., & Sickel, S. (1977) · Defense Technical Information Center (DTIC) · Cited by 39
A Meta-Level Extension of Prolog
Bowen, K. A., & Weinberg, T. (1985) · Syracuse University Libraries (Syracuse University) · Cited by 38
Some issues and trends in the semantics of logic programming
Jaffar, J., Lassez, J.-L., & Maher, M. J. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8_78 · Cited by 27
Formal Languages: Origins and Directions
Greibach, S. A. (1981) · IEEE Annals of the History of Computing · doi:10.1109/mahc.1981.10006 · Cited by 24
(1985) · SLP · Cited by 23
What you always wanted to know about clause graph resolution
Eisinger, N. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16780-3_100 · Cited by 18
A Partial Evaluator of Lisp Programs Written in Prolog.
Kahn, K. (1982) · Cited by 13
Using λ-calculus to represent meanings in logic grammars
Warren, D. S. (1983) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981311.981321 · Cited by 10
Cited by
WIELEMAKER, J., SCHRIJVERS, T., TRISKA, M., & LAGER, T. (2012) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000494 · Cited by 385
An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities
Stolcke, A. (1994) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9411029 · Cited by 336
Olson, G., Herbsleb, J., & Reuter, H. (1994) · Human-Computer Interaction · doi:10.1207/s15327051hci0903&4_6 · Cited by 104
Fifty Years of Prolog and Beyond
KÖRNER, P., LEUSCHEL, M., BARBOSA, J., COSTA, V. S., DAHL, V., HERMENEGILDO, M. V., MORALES, J. F., WIELEMAKER, J., DIAZ, D., ABREU, S., et al. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000102 · Cited by 40
Metadata
- Authors
- Harrison, S. P., Pereira, F. C. N., & Shieber, S. M.
- Venue
- Language
- Publisher
- JSTOR
- Published
- 1988-09
- Volume
- 64
- Issue
- 3
- Pages
- 627
- ISSN
- 0097-8507 (ISSN-L)
- OpenAlex
- W1973180461
- Cited by
- 364
- References
- 63
- FWCI
- 24.85
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.