Handbook of logic in artificial intelligence and logic programming, Volume 3, Nonmonotonic reasoning and uncertain reasoning, edited by Dov M. Gabbay, C. J. Hogger, and J. A. Robinson, with D. Nute, Handbooks of logic in computer science and artificial intelligence and logic programming, Clarendon Press, Oxford University Press, Oxford, New York, etc., 1994, xix + 529 pp.–

2000 ◽  
Vol 6 (4) ◽  
pp. 480-484 ◽  
Author(s):  
G. Aldo Antonelli
2002 ◽  
Vol 31 (4) ◽  
pp. 613-616
Author(s):  
Ronald Gray

In this highly ambitious book, Glynn attempts to provide a description of both how the brain works and how it has developed. Taking an interdisciplinary approach (he is a physiologist by training), he relies on insights from a wide number of disciplines, including psychology, neurology, anthropology, linguistics, artificial intelligence, psychiatry, physiology, and even philosophy. He is interested in providing answers to some perennial and interconnected questions that relate to the mind: “What kind of thing is mind? What is the relation between our minds and our bodies and, more specifically, what is the relation between what goes on in our minds, and what goes on in our brains? How did brains and minds originate? Can our brains be regarded as nothing more than exceedingly complicated machines? Can minds exist without brains” (p. 4). Although his arguments are rather technical, the book is intended for a nonscientist audience.


Logic is now widely recognized as one of the foundational disciplines of computing and has applications in virtually all aspects of the subject, from software engineering and hardware to programming languages and artificial intelligence. The Handbook of Logic in Artificial Intelligence and its companion The Handbook of Logic in Computer Science were created in response to the growing need for an in-depth survey of these applications. This handbook comprises five volumes, each an in-depth overview of one of the major topics in this area. The result of years of cooperative effort by internationally renowned researchers, it will be the standard reference work in AI for years to come. Volume 5 focuses on logic programming. The chapters, which in many cases are of monograph length and scope, emphasize possible unifying themes.


Author(s):  
Andrey Grinblat ◽  
Viktor Lopatkin

The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial [Formula: see text], and any directed finite bipartite graph can be considered as a polynomial [Formula: see text], and vise verse. We also show that the multiplication in the semirings [Formula: see text], [Formula: see text] corresponds to an operation of the corresponding graphs. This operation is exactly the product of Petri nets in the sense of Winskel [G. Winskel and M. Nielsen, Models of concurrency, in Handbook of Logic in Computer Science, Vol. 4, eds. Abamsky, Gabbay and Maibaum (Oxford University Press, 1995), pp. 1–148]. As an application, we give an approach to dividing in the semirings [Formula: see text], [Formula: see text], and a criteria for parallalization of Petri nets. Finally, we endow the set of all bipartite graphs with the Zariski topology.


Sign in / Sign up

Export Citation Format

Share Document