index int64 0 18.8k | text stringlengths 0 826k | year stringdate 1980-01-01 00:00:00 2024-01-01 00:00:00 | No stringlengths 1 4 |
|---|---|---|---|
0 | QUESTION ORDERING IN MIXED INITIATIVE PROGRAM SPECIFICATION DIALOGUE Louis Steinberg Department of Computer Science Rutgers University New Brunswick, N. J. 08903 ABSTRACT It would be nice if a computer system could accept a program specification in the form of a mixed initiative dialogue. One ca... | 1980 | 1 |
1 | AUTOMATIC GENERATION OF SEMANTIC ATTACHMENTS IN FOL Luigia Aiello Computer Science Department Stanford University Stanford, California 94305 ABSTRACT Semantic attachment is provided by FOL as a means for associating model values (i.e. LISP code) to symbols of a firs... | 1980 | 10 |
2 | ABSTRACT HCPRVR: AN INTERPRETER FOR LOGIC PROGRAMS Daniel Chester Department of Computer Sciences University of Texas at Austin An overview of a logic program interpreter written in Lisp is presented. The interpreter is a Horn clause-based theorem prover augmented by L... | 1980 | 11 |
3 | FIRST EXPERIMENTS WITH RUE AUTOMATED DEDUCTION Vincent J. Digricoli The Courant Institute and Hofstra University 251 Mercer Street, New York, N.Y. 10012 ABSTRACT RUE resolution represents a reformulation of binary resolution so that the basic rules of inference (RUE and NRF) incorporate the axioms ... | 1980 | 12 |
4 | WHAT’S WRONG WITH NON-MONOTONIC LOGIC? David J . Israel Bolt Beranek and Newman Inc. 50 Moulton St. Cambridge, Mass. 02238 ABSTRACT In this paper ’ I ask, and attempt to answer, the following question : What’s Wrong with Non-Monotonic Logic? ... | 1980 | 13 |
5 | PATHOLOGY ON GAME TREES: A SUMMARY OF RESULTS* Dana S. Nau Department of Computer Science University of Maryland College Park, MD 20742 ABSTRACT Game trees are widely used as models of various decision-making situations. Empirical results with game-playing ... | 1980 | 14 |
6 | ISEOC9PFREE S. W. Ng and Adrian Walker Work performed at Rutgers University* ABSTRACT If a system uses assertions of the general form x causes y , (e.g. MYCIN rules) then loop situations in which X, causes X2, X2 causes X3, . . . . , X, causes X,, ... | 1980 | 15 |
7 | Applying General Induction Methods to the Card Game Eleusis Thomas G. Dietterich Department of Computer Science Stanford University Stanford, CA 94305 Abstract Research was undertaken with the goal of applying general universally-applicable induction methods to complex real-... | 1980 | 16 |
8 | MODELLING STUDENT ACQUISITION OF PROBLEM-SOLVING SKILLS Robert Smith Department of Computer Science Rutgers University New Brunswick, N. J. 08903 ABSTRACT This paper describes the design of a system that simulates a human student learning to prove tneorems in logic by interacting with a curricul... | 1980 | 17 |
9 | A Computer Model of Child Language Learning Mallory Selfridge Yale University Abstract A computer program modelling a child between the ages of 1 and 2 years is described. This program is based on observations of the knowledge this child had at age 1, the comprehension... | 1980 | 18 |
10 | APPROACHES TO KNOWLEDGE ACQUISITION: THE INSTRUCTABLE PROQUCTION SYSTEM PROJECT Michael D. Rychener Carnegie-Mellon University Department of Computer Science Schenley Park Pittsburgh, PA 15213 Abstract Progress in building systems that acquire knowledge from a va... | 1980 | 19 |
End of preview. Expand in Data Studio
Dataset Card for "AI-paper-crawl"
The dataset contains 11 splits, corresponding to 11 conferences.
For each split, there are several fields:
- "index": Index number starting from 0. It's the primary key;
- "text": The content of the paper in pure text form. Newline is turned into 3 spaces if "-" is not detected;
- "year": A string of the paper's publication year, like "2018". Transform it into int if you need to;
- "No": A string of index number within a year. 1-indexed. In "ECCV" split, the "No" is index number throughout the entire split. It only provides a reference of the order that these papers are accessed, instead of the real publication order.
The "ICLR" split may miss roughly 20%-25% of the papers, since it's collected by searching on arxiv, which may return 0 or more than 1 results.
- Downloads last month
- 34