Per Year

@book{cognitionconversation-book1967,
   apice = {CognitionconversationBook1987},
   author = {George Lakoff},
   booktitle = {Women, Fire, and Dangerous Things. What Categories Reveal about the Mind},
   publisher = {The University of Chicago Press},
   title = {Women, Fire, and Dangerous Things. What Categories Reveal about the Mind},
   year = 1987
}

@article{observation-jcss34,
   abstract = {A new notion of transition systems, called distributed transition systems, is introduced, where states are sets of processes and transitions specify which processes stay idle. A notion of observations based on partial orderings, called concurrent histories, is defined on computations. Several observational equivalences, e.g., bisimulation, are given on observations. As case studies, Petri C/E systems and P/T nets, and Milner's CCS are translated to distributed transition systems.},
   apice = {ObservationJcss34},
   author = {Pierpaolo Degano and Ugo Montanari},
   doi = {10.1016/0022-0000(87)90032-8},
   journal = {Journal of Computer and System Sciences},
   month = apr,
   number = {2-3},
   numpages = 40,
   openalex = {W2027256978},
   pages = {422--461},
   publisher = {Academic Press},
   title = {Concurrent histories: A basis for observing distributed systems},
   url = {http://www.sciencedirect.com/science/article/pii/0022000087900328},
   volume = 34,
   year = 1987
}

@book{bratman87,
   apice = {Bratman87},
   author = {Bratman, Michael E.},
   isbn = {9780674458192},
   isbn10 = {0674458192},
   month = nov,
   publisher = {Harvard University Press},
   title = {Intention, Plans, and Practical Reason},
   year = 1987
}

@article{conjunctivegoals-ai32,
   apice = {ConjunctivegoalsAi32},
   author = {David Chapman},
   doi = {10.1016/0004-3702(87)90092-0},
   issn = {0004-3702},
   journal = {Artificial Intelligence},
   month = jul,
   number = 3,
   numpages = 47,
   openalex = {W2171798962},
   pages = {333--379},
   publisher = {Elsevier B.V.},
   title = {Planning for conjunctive goals},
   url = {https://www.sciencedirect.com/science/article/pii/0004370287900920},
   volume = 32,
   year = 1987
}

@inproceedings{swprocess-icse87,
   address = {Los Alamitos, CA, USA},
   apice = {SwprocessIcse87},
   author = {Osterweil, Leon J.},
   booktitle = {9th International Conference on Software Engineering (ICSE '87)},
   isbn = {0-89791-216-0},
   location = {Monterey, California, United States},
   pages = {2--13},
   publisher = {IEEE Computer Society Press},
   title = {Software Processes are Software too},
   year = 1987
}

@incollection{situatedaction-suchman1987,
   address = {New York, NY, USA},
   apice = {SituatedactionSuchmann1987},
   author = {Suchman, Lucy A.},
   booktitle = {Plans and Situated Actions: The Problem of Human-Machine Communication},
   chapter = 4,
   isbn = {978-0521337397},
   isbn10 = {0-521-33137-4},
   pages = {49--67},
   publisher = {Cambridge University Press},
   title = {Plans and Situated Actions: The Problem of Human-Machine Communication},
   year = 1987
}

@inproceedings{objects-ecoop1987,
   apice = {ObjectsEcoop1987},
   author = {Paola Mello and Natali, Antonio},
   booktitle = {ECOOP'87 European Conference on Object-Oriented Programming},
   doi = {10.1007/3-540-47891-4_17},
   isbn = {978-3-540-18353-2},
   numpages = 11,
   pages = {181--191},
   publisher = {Springer},
   series = {Lecture Notes in Computer Science},
   title = {Objects as Communicating Prolog Units},
   volume = 276,
   year = 1987
}

@article{linearlogic-tcs50,
   apice = {LinearlogicTcs50},
   author = {Girard, Jean-Yves},
   doi = {10.1016/0304-3975(87)90045-4},
   issn = {0304-3975},
   journal = {Theoretical Computer Science},
   number = 1,
   numpages = 102,
   pages = {1--102},
   publisher = {North Holland, Amsterdam},
   title = {Linear logic},
   url = {https://www.sciencedirect.com/science/article/pii/0304397587900454},
   volume = 50,
   year = 1987
}

@book{sculley-book1987,
   apice = {SculleyBook1987},
   author = {John Sculley and John A. Byrne},
   booktitle = {Odyssey: Pepsi to Apple. A Journey of Adventure, Ideas, and the Future},
   isbn = {9780060157807},
   isbn10 = {0060157801},
   publisher = {HarperCollins Publishers},
   title = {Odyssey: Pepsi to Apple. A Journey of Adventure, Ideas, and the Future},
   year = 1987
}

@article{neuralnets-ieeeassspmag4,
   apice = {NeuralnetsIeeeassspmag4},
   author = {Lippmann, Richard P.},
   doi = {10.1109/MASSP.1987.1165576},
   issn = {0740-7467},
   journal = {IEEE ASSP Magazine},
   keywords = {Artificial neural networks;Biological system modeling;Biology computing;Classification algorithms;Clustering algorithms;Concurrent computing;Image recognition;Neural networks},
   month = apr,
   number = 2,
   pages = {4--22},
   title = {An Introduction to Computing with Neural Nets},
   url = {http://ieeexplore.ieee.org/abstract/document/1165576/},
   volume = 4,
   year = 1987
}

@article{inductivetheoremproving-tcs54,
   abstract = {Although Prolog is a programming language based on techniques from theorem proving, its use as a base for a theorem prover has not been explored until recently (Stickel, 1984). In this paper, we introduce a Prolog-based deductive theorem proving method for proving theorems in a first-order inductive theory representable in Horn clauses. The method has the following characteristics: 1. It automatically partitions the domains over which the variables range into subdomains according to the manner in which the predicate symbols in the theorem are defined. 2. For each of the subdomains the prover returns a lemma. If the lemma is true, then the target theorem is true for this subdomain. The lemma could also be an induction hypothesis for the theorem. 3. The method does not explicitly use any inductive inference rule. The induction hypothesis, if needed for a certain subdomain, will sometimes be generated from a (limited) forward chaining mechanism in the prover and not from employing any particular inference rule. In addition to the backward chaining and backtracking facilities of Prolog, our method introduces three new mechanism—skolemization by need, suspended evaluation, and limited forward chaining. These new mechanisms are simple enough to be easily implemented or even incorporated into Prolog. We describe how the theorem prover can be used to prove properties of Prolog programs by showing two simple examples.},
   apice = {InductivetheoremprovingTcs54},
   author = {Jieh Hsiang and Mandayam Srivas},
   doi = {10.1016/0304-3975(87)90016-8},
   issn = {0304-3975},
   journal = {Theoretical Computer Science},
   month = sep,
   number = 1,
   numpages = 26,
   openalex = {W2053332596},
   pages = {3--28},
   publisher = {Elsevier B.V.},
   title = {Automatic inductive theorem proving using Prolog},
   url = {https://www.sciencedirect.com/science/article/pii/0304397587900168},
   volume = 54,
   year = 1987
}

@inproceedings{prs-aaai87,
   address = {Seattle, WA, USA},
   apice = {PrsAaai1987},
   author = {Georgeff, Michael P. and Lansky, Amy L.},
   booktitle = {6th National Conference on Artificial Intelligence (AAAI-87)},
   editor = {Forbus, Kenneth and Shrobe, Howard},
   isbn = {0-934613-42-7},
   isbn13 = {978-0-262-51055-4},
   month = {13-17~} # jul,
   note = {Proceedings},
   pages = {677--682},
   publisher = {AAAI Press},
   title = {Reactive Reasoning and Planning},
   url = {https://www.aaai.org/Papers/AAAI/1987/AAAI87-121.pdf},
   volume = 2,
   year = 1987
}

@inproceedings{clp-popl87,
   abstract = {We address the problem of designing programming systems to reason with and about constraints. Taking a logic programming approach, we define a class of programming languages, the CLP languages, all of which share the same essential semantic properties. From a conceptual point of view, CLP programs are highly declarative and are soundly based within a unified framework of formal semantics. This framework not only subsumes that of logic programming, but satisfies the core properties of logic programs more naturally. From a user's point of view, CLP programs have great expressive power due to the constraints which they naturally manipulate. Intuition in the reasoning about programs is enhanced as a result of working directly in the intended domain of discourse. This contrasts with working in the Herbrand Universe wherein every semantic object has to be explicitly coded into a Herbrand term; this enforces reasoning at a primitive level. Finally, from an implementor's point of view, CLP systems can be efficient because of the exploitation of constraint solving techniques over specific domains.},
   apice = {ClpPopl87},
   author = {Joxan Jaffar and Jean-Louis Lassez},
   booktitle = {POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages},
   doi = {10.1145/41625.41635},
   isbn10 = {0-89791-215-2},
   location = {New York, NY, USA},
   numpages = 9,
   pages = {111--119},
   publisher = {ACM},
   title = {Constraint Logic Programming},
   year = 1987
}