Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
J. Michael Dunn on information based logics
Bimbó K. (ed), Springer International Publishing, New York, NY, 2016. 436 pp. Type: Book (978-3-319292-98-4)
Date Reviewed: Apr 20 2017

Apart from introductory material and an “autobio,” these articles on Dunn’s work can be divided into three areas:

  • Relevance logic (which Australians call “relevant” logic), the area in which Dunn did his doctoral thesis and initial work;
  • Recent work on beliefs, counting, probability, and spatial logic, which reveal his varied interests; and
  • A central set of articles on what Dunn calls “information based logics.” The articles’ titles mention contents, information, negation, falsification, verification, truth, falsehood, and evidence. For example, Heinrich Wansing addresses the symmetry of positive and negative information, which is questioned in an earlier article by Sebastian Sequoiah-Grayson, another contributor to this volume.

I enjoyed reading Alasdair Urquhart’s story of Dunn’s original discovery, with Robert K. Meyer, of the admissibility of disjunctive syllogism in relevance logic, and different proofs that came up later. Discussing a proof of Saul Kripke, Urquhart poses the open question whether the use of this proof rule gives a “speedup theorem” in relevance logic with much shorter proofs. This theme recurs in Larry Moss’ article on syllogisms that express counting properties, regarding the admissibility of reductio. Johan van Benthem’s article talks about the “grand picture” of “the interplay of storing a lot of information about the past versus compressing information” (as an example of which he mentions forgetting).

Computing science arose from decision problems in logic and mathematical proofs, which led to the definition of computational models. Later this was refined into a study of the complexity of algorithms. More recently, computing science has dealt with informational problems, such as collecting pieces of information, which may together be inconsistent, and arriving at a belief that appears most plausible given the data. These questions first arose in the model theory of relevance logics. The proof theory of relevance logics appears to raise issues of succinctness of representations and efficiency of recovery of inferences from them.

Big data is a fashionable theme today. These articles will be valuable to graduate students and researchers who are more attracted to the underlying logical structure rather than the extraction of significance from number crunching.

Reviewer:  K. Lodaya Review #: CR145206 (1707-0430)
Bookmark and Share
  Reviewer Selected
 
 
Knowledge Representation Formalisms And Methods (I.2.4 )
 
 
Computational Logic (F.4.1 ... )
 
 
Deduction And Theorem Proving (I.2.3 )
 
 
Mathematical Logic (F.4.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Knowledge Representation Formalisms And Methods": Date
Knowledge representation: an approach to artificial intelligence
Bench-Capon T., Academic Press Prof., Inc., San Diego, CA, 1990. Type: Book (9780120864409)
Jul 1 1991
Truth and modality for knowledge representation
Turner R., MIT Press, Cambridge, MA, 1991. Type: Book (9780262200806)
Nov 1 1991
Constraint relaxation may be perfect
Montanari U., Rossi F. (ed) Artificial Intelligence 48(2): 143-170, 1991. Type: Article
Aug 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy