Skip to main content
View Cart

Books in Logics and meanings of programs

  • Higher Order Logic Theorem Proving and its Applications

    Proceedings of the IFIP TC10/WG10.2 International Workshop on Higher Order Logic Theorem Proving and its Applications - HOL '92 Leuven, Belgium, 21-24 September 1992
    • 1st Edition
    • Volume 20
    • May 23, 2014
    • L.J.M. Claesen + 1 more
    • English
    The HOL system is a higher order logic theorem proving system implemented at Edinburgh University, Cambridge University and INRIA. Its many applications, from the verification of hardware designs at all levels to the verification of programs and communication protocols are considered in depth in this volume. Other systems based on higher order logic, namely Nuprl and LAMBDA are also discussed. Features given particular consideration are: novel developments in higher order logic and its implementations in HOL; formal design and verification methodologies for hardware and software; public domain availability of the HOL system. Papers addressing these issues have been divided as follows: Mathematical Logic; Induction; General Modelling and Proofs; Formalizing and Modelling of Automata; Program Verification; Hardware Description Language Semantics; Hardware Verification Methodologies; Simulation in Higher Order Logic; Extended Uses of Higher Order Logic. Academic and industrial researchers involved in formal hardware and software design and verification methods should find the publication especially interesting and it is hoped it will also provide a useful reference tool for those working at software institutes and within the electronics industries.

  • Logical Foundations of Artificial Intelligence

    • 1st Edition
    • July 5, 2012
    • Michael R. Genesereth + 1 more
    • English
    Intended both as a text for advanced undergraduates and graduate students, and as a key reference work for AI researchers and developers, Logical Foundations of Artificial Intelligence is a lucid, rigorous, and comprehensive account of the fundamentals of artificial intelligence from the standpoint of logic.The first section of the book introduces the logicist approach to AI--discussing the representation of declarative knowledge and featuring an introduction to the process of conceptualization, the syntax and semantics of predicate calculus, and the basics of other declarative representations such as frames and semantic nets. This section also provides a simple but powerful inference procedure, resolution, and shows how it can be used in a reasoning system.The next several chapters discuss nonmonotonic reasoning, induction, and reasoning under uncertainty, broadening the logical approach to deal with the inadequacies of strict logical deduction. The third section introduces modal operators that facilitate representing and reasoning about knowledge. This section also develops the process of writing predicate calculus sentences to the metalevel--to permit sentences about sentences and about reasoning processes. The final three chapters discuss the representation of knowledge about states and actions, planning, and intelligent system architecture.End-of-... bibliographic and historical comments provide background and point to other works of interest and research. Each chapter also contains numerous student exercises (with solutions provided in an appendix) to reinforce concepts and challenge the learner. A bibliography and index complete this comprehensive work.

  • Handbook of Automated Reasoning

    • 1st Edition
    • Volume 1
    • June 22, 2001
    • Alan J.A. Robinson + 1 more
    • English
    Handbook of Automated Reasoning presents overviews of the fundamental notations, techniques, ideas and methods developed and used in automated reasoning and its practical applications, which are used in many areas of computer science, including software and hardware, logic and functional programming, formal methods, knowledge representation, deductive databases, and artificial intelligence.

  • Handbook of Automated Reasoning

    • 1st Edition
    • Volume II
    • June 21, 2001
    • Alan J.A. Robinson + 1 more
    • English

  • Tree Automata and Languages

    • 1st Edition
    • Volume 10
    • July 31, 1992
    • M. Nivat + 1 more
    • English
    The theory of tree languages, founded in the late Sixties and still active in the Seventies, was much less active during the Eighties. Now there is a simultaneous revival in several countries, with a number of significant results proved in the past five years. A large proportion of them appear in the present volume.The editors of this volume suggested that the authors should write comprehensive half-survey papers. This collection is therefore useful for everyone interested in the theory of tree languages as it covers most of the recent questions which are not treated in the very few rather old standard books on the subject. Trees appear naturally in many chapters of computer science and each new property is likely to result in improvement of some computational solution of a real problem in handling logical formulae, data structures, programming languages on systems, algorithms etc. The point of view adopted here is to put emphasis on the properties themselves and their rigorous mathematical exposition rather than on the many possible applications.This volume is a useful source of concepts and methods which may be applied successfully in many situations: its philosophy is very close to the whole philosophy of the ESPRIT Basic Research Actions and to that of the European Association for Theoretical Computer Science.

  • Language in Action

    Categories, Lambdas and Dynamic Logic
    • 1st Edition
    • Volume 130
    • February 12, 1991
    • J. van Benthem
    • English
    This monograph began life as a series of papers documenting five years of research into the logical foundations of Categorial Grammar, a grammatical paradigm which has close analogies with Lambda Calculus and Type Theory. The technical theory presented here stems from the interface between Logic and Linguistics and, in particular, the theory of generalized quantification. A categorical framework with lambda calculus-oriented semantics is a convenient vehicle for generalizing semantic insights (obtained in various corners of natural language) into one coherent theory.The book aims to demonstrate to fellow logicians that the resulting applied lambda calculus has intrinsic logical interest. In the final analysis, the idea is not just to `break the syntactic code' of natural languages but to understand the cognitive functioning of the human mind.