Luca Viganò is an assistant professor at the Institute for Computer Science of the University of Freiburg (Germany). His research focuses on the theory and applications of non-classical logics, of proof development systems, of logical frameworks, and of logics for security.
Labelled deduction is an approach to providing frameworks for presenting and using different logics in a uniform and natural way by enriching the language of a logic with additional information of a semantic proof-theoretical nature.
Labelled deduction systems often possess attractive properties, such as modularity in the way that families of related logics are presented, parameterised proofs of metatheoretic properties, and ease of mechanisability. It is thus not surprising that labelled deduction has been applied to problems in computer science, AI, mathematical logic, cognitive science, philosophy and computational linguistics - for example, formalizing and reasoning about dynamic `state oriented' properties such as knowledge, belief, time, space, and resources.
Preface. Contributing Authors. Labelled Proof Systems for Intuitionistic Provability; V. Balat, D. Galmiche. Normal Multimodal Logics with Interaction Axioms; M. Baldoni. The SAT Problem of Signed CNF Formulas; B. Beckert, R. Hähnle, F. Manyà. Discipline as Logic: Treating Labels as First Class Citizens; P. Blackburn. Labelled Abduction (I); K. Broda, D.M. Gabbay. Labelled Tableaux for Propositional Linear Time Logic over Finite Frames; S. Cerrito, M. Cialdea Mayer. Fibred Modal Tableaux; D.M. Gabbay, G. Governatori. Labelled Deduction for the Guarded Fragment; M. Marx, S. Mikulás, S. Schlobach. Semantics for Temporal Annotated Constraint Logic Programming; A. Raffaetà, T. Frühwirth. The Logic of Reusable Propositional Output with the Fulfilment Constraint; L. van der Torre.
Labelled deduction is an approach to providing frameworks for presenting and using different logics in a uniform and natural way by enriching the language of a logic with additional information of a semantic proof-theoretical nature.
Labelled deduction systems often possess attractive properties, such as modularity in the way that families of related logics are presented, parameterised proofs of metatheoretic properties, and ease of mechanisability. It is thus not surprising that labelled deduction has been applied to problems in computer science, AI, mathematical logic, cognitive science, philosophy and computational linguistics - for example, formalizing and reasoning about dynamic `state oriented' properties such as knowledge, belief, time, space, and resources.
Labelled Proof Systems for Intuitionistic Provability.- Normal Multimodal Logics with Interaction Axioms.- The SAT Problem of Signed CNF Formulas.- Discipline as Logic: Treating Labels as First Class Citizens.- Labelled Abduction.- Labelled Tableaux for Propositional Linear Time Logic over Finite Frames.- Fibred Modal Tableaux.- Labelled Deduction for the Guarded Fragment.- Semantics for Temporal Annotated Constraint Logic Programming.- Alessandra Raffaetà.- The Logic of Reusable Propositional Output with the Fulfilment Constraint.
Über den Autor
Luca Viganò is an assistant professor at the Institute for Computer Science of the University of Freiburg (Germany). His research focuses on the theory and applications of non-classical logics, of proof development systems, of logical frameworks, and of logics for security.
Inhaltsverzeichnis
Preface. Contributing Authors. Labelled Proof Systems for Intuitionistic Provability; V. Balat, D. Galmiche. Normal Multimodal Logics with Interaction Axioms; M. Baldoni. The SAT Problem of Signed CNF Formulas; B. Beckert, R. Hähnle, F. Manyà. Discipline as Logic: Treating Labels as First Class Citizens; P. Blackburn. Labelled Abduction (I); K. Broda, D.M. Gabbay. Labelled Tableaux for Propositional Linear Time Logic over Finite Frames; S. Cerrito, M. Cialdea Mayer. Fibred Modal Tableaux; D.M. Gabbay, G. Governatori. Labelled Deduction for the Guarded Fragment; M. Marx, S. Mikulás, S. Schlobach. Semantics for Temporal Annotated Constraint Logic Programming; A. Raffaetà, T. Frühwirth. The Logic of Reusable Propositional Output with the Fulfilment Constraint; L. van der Torre.
Klappentext
Labelled deduction is an approach to providing frameworks for presenting and using different logics in a uniform and natural way by enriching the language of a logic with additional information of a semantic proof-theoretical nature.
Labelled deduction systems often possess attractive properties, such as modularity in the way that families of related logics are presented, parameterised proofs of metatheoretic properties, and ease of mechanisability. It is thus not surprising that labelled deduction has been applied to problems in computer science, AI, mathematical logic, cognitive science, philosophy and computational linguistics - for example, formalizing and reasoning about dynamic `state oriented' properties such as knowledge, belief, time, space, and resources.
Springer Book Archives
