Search
Skip to Search Results-
[Review of the book Everything Linguists Have Always Wanted to Know About Logic, by JcCawley]
Download1983
Introduction: James McCawley is a noted linguist whose concern with semantic matters in dealing with linguistic issues is well-known amongst philosophers of language. McCawley's goal here was to write a textbook that surveyed all those areas of logic he thinks are potentially of use in analyzing...
-
[Review of the book Formal Methods in Artificial Intelligence, by Aamsay]
1996
Introduction: Many universities teach artificial intelligence (AI) by having one undergraduate course that introduces students to a very wide variety of topics, usually including search and search heuristics, representational systems (including formal logic), problem solving, vision, expert...
-
1991
Pelletier, Francis J., Schubert, Lenhart
Introduction: This very short book is apparently intended as a supplementary text in a graduate AI course. The author describes it as a \"text and reference work on the applications of non-standard logics to artificial intelligence (AI).\" It gives short and concise (too short and too concise, in...
-
[Review of the book Representation and Inference for Natural Language: A First Course in Computational Semantics, by Plackburn, & Jos]
Download2006
Introduction: Computational semantics is the study of how to represent meaning in a way that computers can use. For the authors of this textbook, this study includes the representation of the meaning of natural language in logic formalisms, the recognition of certain relations that hold within...
-
1974
Introduction: In the preface of this book, Copi explains that he has \"tried to give an account of the Theory of Logical Types which shall not be so technical as to repel the non-specialist nor so informal as to disappoint the serious student who wants to see exactly what it is and how it works\"...
-
1995
Pelletier, Francis J., Sutcliffe, Geoff
Introduction: In 1986 Pelletier published an annotated list of logic problems, intended as an aid for students, developers, and researchers to test their automated theorem proving (ATP) systems. The 75 problems in the list are subdivided into propositional logic (Problems 1-17), monadic-predicate...
-
1997
Pelletier, Francis J., Elio, Renée
This study examines the problem of belief revision, defined as deciding which of several initially accepted sentences to disbelieve, when new information presents a logical inconsistency with the initial set. In the first three experiments, the initial sentence set included a conditional...
-
1982
Pelletier, Francis J., Schubert, Lenhart K.
Introduction: We describe an approach to parsing and logical translation that was inspired by Gazdar's work on context-free grammar for English. Each grammar rule consists of a syntactic part that specifies an acceptable fragment of a parse tree, and a semantic part that specifies how the logical...
-
1986
Pelletier, Francis J., Rudnicki, Piotr
Introduction: Some problems that are difficult for automated theorem provers (ATPs) are so merely because of their size, but not because of any logical or conceptual complexity. Examples of this type of difficult problem have been published in the past: see Pelletier [1986: problems 12, 29, 34,...
-
1977
It is an extremely popular view among logicians and some linguists (McCawley, Hurford) that there are two distinct or's in English - an \"inclusive\" and an \"exclusive\". It seems equally popular among lexicographers, experts on proper usage, and some linguists (R. Lakoff) that there is only...