Listing 1 - 10 of 73 | << page >> |
Sort by
|
Choose an application
Linear logic, introduced in 1986 by J.-Y. Girard, is based upon a fine grain analysis of the main proof-theoretical notions of logic. The subject develops along the lines of denotational semantics, proof nets and the geometry of interaction. Its basic dynamical nature has attracted computer scientists, and various promising connections have been made in the areas of optimal program execution, interaction nets and knowledge representation. This book is the refereed proceedings of the first international meeting on linear logic held at Cornell University, in June 1993. Survey papers devoted to specific areas of linear logic, as well as an extensive general introduction to the subject by J.-Y. Girard, have been added, so as to make this book a valuable tool both for the beginner and for the advanced researcher.
Choose an application
Logic --- Logic, Symbolic and mathematical --- Logic. --- Logic, Symbolic and mathematical.
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
The proceedings of LICS'95 comprise technical papers on topics in program logics, finite models, model checking and verification, theorem proving and AI, concurrency, semantics, lambda calculus and types, unification and rewriting, and linear logic. There are also four invited presentations: a complete proof system for QPTL; the semantic challenge of Verilog HDL; experience using type theory as a foundation for computer science; and origins and metamorphoses of the trinity--logic, nets, automata. No index. Annotation copyright by Book News, Inc., Portland, OR.
Computer science --- Logic, Symbolic and mathematical --- Mathematics
Choose an application
The proceedings of LICS'95 comprise technical papers on topics in program logics, finite models, model checking and verification, theorem proving and AI, concurrency, semantics, lambda calculus and types, unification and rewriting, and linear logic. There are also four invited presentations: a complete proof system for QPTL; the semantic challenge of Verilog HDL; experience using type theory as a foundation for computer science; and origins and metamorphoses of the trinity--logic, nets, automata. No index. Annotation copyright by Book News, Inc., Portland, OR.
Computer science --- Logic, Symbolic and mathematical --- Mathematics
Choose an application
Epistemic logic has grown from its philosophical beginnings to find diverse applications in computer science as a means of reasoning about the knowledge and belief of agents. This book, based on courses taught at universities and summer schools, provides a broad introduction to the subject; many exercises are included together with their solutions. The authors begin by presenting the necessary apparatus from mathematics and logic, including Kripke semantics and the well-known modal logics K, T, S4 and S5. Then they turn to applications in the contexts of distributed systems and artificial intelligence: topics that are addressed include the notions of common knowledge, distributed knowledge, explicit and implicit belief, the interplays between knowledge and time, and knowledge and action, as well as a graded (or numerical) variant of the epistemic operators. The problem of logical omniscience is also discussed extensively. Halpern and Moses' theory of honest formulae is covered, and a digression is made into the realm of non-monotonic reasoning and preferential entailment. Moore's autoepistemic logic is discussed, together with Levesque's related logic of 'all I know'. Furthermore, it is shown how one can base default and counterfactual reasoning on epistemic logic.
Computer science. --- Artificial intelligence. --- Logic, Symbolic and mathematical.
Choose an application
Listing 1 - 10 of 73 | << page >> |
Sort by
|