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.
Author(s): David Basin, Marcello D’Agostino, Dov M. Gabbay, Seán Matthews, Luca Viganò (eds.)
Series: Applied Logic Series 17
Edition: 1
Publisher: Springer Netherlands
Year: 2000
Language: English
Pages: 267
Tags: Logic; Artificial Intelligence (incl. Robotics)
Front Matter....Pages i-xi
Labelled Proof Systems for Intuitionistic Provability....Pages 1-32
Normal Multimodal Logics with Interaction Axioms....Pages 33-57
The SAT Problem of Signed CNF Formulas....Pages 59-80
Discipline as Logic: Treating Labels as First Class Citizens....Pages 81-105
Labelled Abduction....Pages 107-134
Labelled Tableaux for Propositional Linear Time Logic Over Finite Frames....Pages 135-159
Fibred Modal Tableaux....Pages 161-191
Labelled Deduction for the Guarded Fragment....Pages 193-214
Semantics for Temporal Annotated Constraint Logic Programming....Pages 215-243
The Logic of Reusable Propositional Output with the Fulfilment Constraint....Pages 245-266
Back Matter....Pages 267-267
