SlideShare ist ein Scribd-Unternehmen logo
1 von 28
Downloaden Sie, um offline zu lesen
Fun with Constructive
Modalities
       Valeria de Paiva
            Cuil, Inc.




PUC Rio de Janeiro, June 2009
An applied logician’s job is never
done…
   When modeling an implemented system as a logic
    you can start from the system




   Or you can start from logics that could fit it
   Hopefully the two meet up…
This talk: Off-the-shelf logical systems


                     The pieces of the
                      puzzle...
                       –   FOL
                       –    HOL
                       –   Modal logic
                       –   Description logic
                       –   Hybrid logic
                       –   MCS/LMS
                       –   Intensional Logic
                       –   Etc…
Outline

   Motivation
   Brief history?
   Constructive modal logic
   Constructive hybrid logic
   Constructive description logic
   Discussion
Motivation: Constructive Modalities?

   Modalities and modal logic: the most
    successful logical framework in CS
   Temporal logic, knowledge operators, BDI
    models, security issues, AI, natural language
    understanding and inference, databases, etc..
   Logic used both to create logical
    representation of information and to reason
    about it
   Usually classical modalities
   What about constructive modalities?
Motivation: Constructive Modalities?

   Constructive logic: a logical basis for
    programming via Curry-Howard
    correspondences
   Modalities extremely useful
   Constructive modalities twice as useful?
   examples from applications abound
   Which constructive modalities?
   Usual phenomenon: classical facts can be
    construed in many different ways
    constructively, choosing is an art...
•Constructive reasoning:
 what, why, how...
   What: Reasoning principles that are safer
   if I ask you whether “There is x such that P(x)”,
   I'm happier with an answer “yes, x_0”, than
    with an answer “yes, for all x it is not the case
    that not P(x)”.
   Why: want reasoning to be as precise and safe
    as possible
   How: constructive reasoning as much as
    possible, but classical if need be
A brief history

   Debates over constructive or classical logics
    since the beginning of the 20th century
   Modal logics from 1920's - Lewis
   Kripke-like semantics in the 60s.
   Connections constructive/modal logic:
    – Algebraic McKinsay/Tarski 30s
    – Kripke semantics, for both 65
    – Modal type theories, 90's
   Putting constructive and modal together:
   Fitch 1948 MIPC, Bull 1966, Prawitz 1965,
    Curry,
More brief history...

   Intuitionistic modal logic:
    –   Analogy
    –   Semantics
    –   Translations
    –   Other
   Fisher-Servi 80's,
   Bozic-Dosen, 84, Volter/Zacharyaschev 88
   Simpson, Gabbay, Masini/Martini early 90's
   Mendler, Fairtlough, Bierman/dePaiva, etc
   Overviews: Goldblatt, IMLA'04 (dePaiva,
    Mendler, Gore')
Constructive modal logics

   Basic ideas:
    –   Box, Diamond like forall/exists
    –   Intuitionistic logic like S4-modal logic,
    –   where A-->B = Box A → B
    –   Combining modalities not that easy...
   To have ``intuitionistic modal logic” need to
    have two modalities, how do they interact?
    – Commuting squares possibilities
   Adding syntax: hypersequents, labelled
    deduction systems, adding semantics to
    syntax (many ways...)
Constructive modal logics

   Personal programme:
   constructive modal logics with axioms,
    sequents and natural deduction formulations
   Also with algebraic, Kripke and categorical
    semantics
   With translations between formulations and
    proved equivalences/embeddings
   Translating proofs more than simply theorems
       broad view of constructive and/or modality
Simpson Desiderata for IML '94

   IML is a conservative extension of IPL.
   IML contains all substitutions instances of
    theorems of IPL and is closed under modus
    ponen.
   Adding excluded middle to IML yields a
    standard classical modal logic
   If “A or B” is a theorem of IML either A is a
    theorem or B is a theorem too.
   Box and Diamond are independent in IML.
   (Intuitionistic) Meaning of the modalities, wrt it
    IML is sound and complete
Extensions: Description and Hybrid
Logics
   Description and Hybrid logics are closely
    associated with modal logics
   Both classes tend to be classical logics, for
    the same reasons above
   We discuss both constructive hybrid logics
    (Brauner/dePaiva 03) and constructive
    description logics (dePaiva05) in turn.
Constructive Hybrid Logic?

   What are hybrid logics?
   Extension of modal logic, where we make part
    of the syntax of the formulae the worlds at
    which they're evaluated.
   Add to basic modal logic second kind of
    propositional symbols (nominals) and
    satisfaction operators
   A nominal is assumed to be true at exactly one
    world
   A formula like a:A where a is a nominal and A
    is a formula is called a satisfaction statement
Constructive Hybrid Logic!

   Brauner/dePaiva ('03, '05)
   Which kind of constructive?
   Depends on kind of constructive modal logic
   Many choices for syntax and for models.
   Our choice: modal base Simpson-style,
    Natural Deduction style.
   Results: IHL as a ND system, models,
    soundness and completeness, extensions to
    geometric theories
   Open problem: hybrid system CK style?...
What Are Description Logics?
   A family of logic based Knowledge Representation
    formalisms
    – Descendants of semantic networks and KL-ONE
    – Describe domain in terms of concepts (classes), roles
      (properties, relationships) and individuals
   Distinguished by:
    – Formal semantics (typically model theoretic)
        » Decidable fragments of FOL (often contained in C2)
        » Closely related to Propositional Modal, Hybrid & Dynamic
          Logics
        » Closely related to Guarded Fragment
    – Provision of inference services
        » Decision procedures for key problems (satisfiability,
          subsumption, etc)
        » Implemented systems (highly optimised)
                                  Thanks Ian Horrocks!
DL Basics
   Concepts (formulae/unary predicates)
    – E.g., Person, Doctor, HappyParent, etc.
   Roles (modalities/relations)
    – E.g., hasChild, loves
   Individuals (nominals/constants)
    – E.g., John, Mary, Italy
   Operators (for forming concepts and roles) restricted so
    that:
    – Satisfiability/subsumption is decidable and, if possible, of low
      complexity
    – No need for explicit use of variables
    – Features such as counting (graded modalities) succinctly
      expressed
What are description logics?

   A sublogic of FOL?
   Or a sublogic of Modal logic?

                     FOL
               t1

         ALC
                           st
               t2
                     Kn
Constructive Description Logic via
Translation
   DL can be defined via t1 translation into FOL
   To constructivize it transform FOL into IFOL
    Call system IALC
   DL can be defined via t2 translation into
    multimodal K (Schilds91)
   Need to choose a constructive K
   Using IK (Simpson) call system iALC, using
    CK (Mendler & de Paiva) call system cALC
Two translations

   Into first-order logic t1:ALC → FOL
   concept C maps to C(x), role R maps to
    relation, quantifiers the point

   Into modal logic t2:ALC → Kn, roles into
    boxes, diamonds
Constructive Description Logic: IALC

   Basic idea: translate description syntax using t1 into
    IFOL, instead of FOL
   No excluded middle, no duality between existential
    and universal quantifiers, no duality between
    conjunction and disjunction
   Pros: IFOL fairly standard
    – Can provide IALC models easily
   Cons: semantics of IFOL more complicated…
   Result: Given IALC model M, given formula Am M
    satisfies A iff M satisfies t1(Α), that is
    t1 is truth-preserving translation
Constructive Description Logic: iALC
and cALC
   Basic idea: translate description syntax using
    t2 into constructive modal logic, instead of
    classical modal Kn.
   Which constructive K?
   If Simpson’s IK iALC,
   if Mendler/de Paiva CK cALC
   Difference: distribution of possibility over
    disjunction and nullary one:
   Dia (A or B) → Dia A or Dia B
   Dia (false) → false
Constructive Description Logic II: iALC

   Note that translation t2 into constructive
    modal logic is the same for both iALC and
    cALC, just the target language change.
   For iALC, can use our work on intuitionistic
    hybrid logic
   Models easily described
   Framework: several modal logics + geometric
    theories
   Referee’s remark: complexity?
Constructive Description Logic II:
cALC
   For cALC, can use our work on an extended
    Curry-Howard isomorphism for constructive
    modal logic
   No Framework: can only do S4 and K
   Can do Kripke models and categorical
    models
   Haven’t investigated interpolation, decidability
    or complexity
   New work by Mendler and Schiele
Related Work
   Mendler/Schiele on constructive description
    for auditing
   Bozzato, Ferrari et al, CHI for ALC, diff HH
    and A Rademaker?
   Odintsov and Wansing’s “Inconsistent-
    tolerant description logic I and II”
    – Motivation is paraconsistency, not constructivity
   Hofmann’s “Proof theoretical Approach to DL”
    – Motivation fixpoints in description logics and their
      complexity
   Straccia’s and Patel-Schneider’s papers on 4-
    valued description logic
    – Motivations are fuzziness and uncertainty
Discussion

   This is very preliminary
   While it is true that constructive reasoning multiply
    concepts, there should be criteria to identify best
    system(s?)
   Part of bigger programme of constructivizing logics
    for computer science
   Want to keep criteria both from theory and
    applications
   Next steps: criteria from modal/hybrid logic,
    bisimulations, complexity bounds, temporal logics,
    etc…
References
   Natural Deduction and Context as (Constructive) Modality (V. de
    Paiva). In Proceedings of the 4th International and
    Interdisciplinary Conference CONTEXT 2003, Stanford, CA,
    USA, Springer Lecture Notes in Artificial Intelligence, vol 2680,
    2003.
   Constructive CK for Contexts (M. Mendler, V de Paiva), In
    Proceedings of the Worskhop on Context Representation and
    Reasoning, Paris, France, July 2005.
    Intuitionistic Hybrid Logic (T. Brauner, V. de Paiva), Presented
    at Methods for Modalities 3, LORIA, Nancy, France, September
    22-23, 2003. Full paper in Journal of Applied Logic 2005
   .Modalities in Constructive Logics and Type Theories Preface to
    the special issue on Intuitionistic Modal Logic and Application of
    the Journal of Logic and Computation, volume 14, number 4,
    August 2004. Guest Editors: Valeria de Paiva, Rajeev Gore' and
    Michael Mendler.
   Constructive Description Logics: what, why and how. (extended
    draft) Presented at Context Representation and Reasoning,
    Riva del Garda, August 2006.
Thanks!

papers/preprints at
http://www.cs.bham.ac.uk/~vdp/publications/papers.html

Weitere ähnliche Inhalte

Was ist angesagt?

Intuitive Semantics for Full Intuitionistic Linear Logic (2014)
Intuitive Semantics for Full Intuitionistic Linear Logic (2014)Intuitive Semantics for Full Intuitionistic Linear Logic (2014)
Intuitive Semantics for Full Intuitionistic Linear Logic (2014)Valeria de Paiva
 
Categorical Semantics for Explicit Substitutions
Categorical Semantics for Explicit SubstitutionsCategorical Semantics for Explicit Substitutions
Categorical Semantics for Explicit SubstitutionsValeria de Paiva
 
Going Without: a modality and its role
Going Without: a modality and its roleGoing Without: a modality and its role
Going Without: a modality and its roleValeria de Paiva
 
A Dialectica Model of Relevant Type Theory
A Dialectica Model of Relevant Type TheoryA Dialectica Model of Relevant Type Theory
A Dialectica Model of Relevant Type TheoryValeria de Paiva
 
Dialectica amongst friends
Dialectica amongst friendsDialectica amongst friends
Dialectica amongst friendsValeria de Paiva
 
Relevant Dialectica Categories
Relevant Dialectica CategoriesRelevant Dialectica Categories
Relevant Dialectica CategoriesValeria de Paiva
 
Constructive Modal Logics, Once Again
Constructive Modal Logics, Once AgainConstructive Modal Logics, Once Again
Constructive Modal Logics, Once AgainValeria de Paiva
 
Dialectica Categories for the Lambek Calculus
Dialectica Categories for the Lambek CalculusDialectica Categories for the Lambek Calculus
Dialectica Categories for the Lambek CalculusValeria de Paiva
 
Dialectica Categories and Petri Nets
Dialectica Categories and Petri NetsDialectica Categories and Petri Nets
Dialectica Categories and Petri NetsValeria de Paiva
 
Benchmarking Linear Logic Proofs, Valeria de Paiva
Benchmarking Linear Logic Proofs, Valeria de PaivaBenchmarking Linear Logic Proofs, Valeria de Paiva
Benchmarking Linear Logic Proofs, Valeria de PaivaValeria de Paiva
 
Dialectica Categories and Petri Nets
Dialectica Categories and Petri NetsDialectica Categories and Petri Nets
Dialectica Categories and Petri NetsValeria de Paiva
 
Dialectica Categories: the Relevant version, Valeria de Paiva
Dialectica Categories: the Relevant version, Valeria de PaivaDialectica Categories: the Relevant version, Valeria de Paiva
Dialectica Categories: the Relevant version, Valeria de PaivaValeria de Paiva
 
Pure Algebra to Applied AI: a personal journey
Pure Algebra to Applied AI: a personal journeyPure Algebra to Applied AI: a personal journey
Pure Algebra to Applied AI: a personal journeyValeria de Paiva
 
Negation in the Ecumenical System
Negation in the Ecumenical SystemNegation in the Ecumenical System
Negation in the Ecumenical SystemValeria de Paiva
 
Going Without: a modality and its role
Going Without: a modality and its roleGoing Without: a modality and its role
Going Without: a modality and its roleValeria de Paiva
 
Dialectica Categories: the mathematical version
Dialectica Categories: the mathematical versionDialectica Categories: the mathematical version
Dialectica Categories: the mathematical versionValeria de Paiva
 
Benchmarking Linear Logic Proofs
Benchmarking Linear Logic ProofsBenchmarking Linear Logic Proofs
Benchmarking Linear Logic ProofsValeria de Paiva
 
Benchmarking Linear Logic Proofs
Benchmarking Linear Logic ProofsBenchmarking Linear Logic Proofs
Benchmarking Linear Logic ProofsValeria de Paiva
 

Was ist angesagt? (20)

Constructive Modalities
Constructive ModalitiesConstructive Modalities
Constructive Modalities
 
Intuitive Semantics for Full Intuitionistic Linear Logic (2014)
Intuitive Semantics for Full Intuitionistic Linear Logic (2014)Intuitive Semantics for Full Intuitionistic Linear Logic (2014)
Intuitive Semantics for Full Intuitionistic Linear Logic (2014)
 
Categorical Semantics for Explicit Substitutions
Categorical Semantics for Explicit SubstitutionsCategorical Semantics for Explicit Substitutions
Categorical Semantics for Explicit Substitutions
 
Going Without: a modality and its role
Going Without: a modality and its roleGoing Without: a modality and its role
Going Without: a modality and its role
 
A Dialectica Model of Relevant Type Theory
A Dialectica Model of Relevant Type TheoryA Dialectica Model of Relevant Type Theory
A Dialectica Model of Relevant Type Theory
 
Dialectica Comonads
Dialectica ComonadsDialectica Comonads
Dialectica Comonads
 
Dialectica amongst friends
Dialectica amongst friendsDialectica amongst friends
Dialectica amongst friends
 
Relevant Dialectica Categories
Relevant Dialectica CategoriesRelevant Dialectica Categories
Relevant Dialectica Categories
 
Constructive Modal Logics, Once Again
Constructive Modal Logics, Once AgainConstructive Modal Logics, Once Again
Constructive Modal Logics, Once Again
 
Dialectica Categories for the Lambek Calculus
Dialectica Categories for the Lambek CalculusDialectica Categories for the Lambek Calculus
Dialectica Categories for the Lambek Calculus
 
Dialectica Categories and Petri Nets
Dialectica Categories and Petri NetsDialectica Categories and Petri Nets
Dialectica Categories and Petri Nets
 
Benchmarking Linear Logic Proofs, Valeria de Paiva
Benchmarking Linear Logic Proofs, Valeria de PaivaBenchmarking Linear Logic Proofs, Valeria de Paiva
Benchmarking Linear Logic Proofs, Valeria de Paiva
 
Dialectica Categories and Petri Nets
Dialectica Categories and Petri NetsDialectica Categories and Petri Nets
Dialectica Categories and Petri Nets
 
Dialectica Categories: the Relevant version, Valeria de Paiva
Dialectica Categories: the Relevant version, Valeria de PaivaDialectica Categories: the Relevant version, Valeria de Paiva
Dialectica Categories: the Relevant version, Valeria de Paiva
 
Pure Algebra to Applied AI: a personal journey
Pure Algebra to Applied AI: a personal journeyPure Algebra to Applied AI: a personal journey
Pure Algebra to Applied AI: a personal journey
 
Negation in the Ecumenical System
Negation in the Ecumenical SystemNegation in the Ecumenical System
Negation in the Ecumenical System
 
Going Without: a modality and its role
Going Without: a modality and its roleGoing Without: a modality and its role
Going Without: a modality and its role
 
Dialectica Categories: the mathematical version
Dialectica Categories: the mathematical versionDialectica Categories: the mathematical version
Dialectica Categories: the mathematical version
 
Benchmarking Linear Logic Proofs
Benchmarking Linear Logic ProofsBenchmarking Linear Logic Proofs
Benchmarking Linear Logic Proofs
 
Benchmarking Linear Logic Proofs
Benchmarking Linear Logic ProofsBenchmarking Linear Logic Proofs
Benchmarking Linear Logic Proofs
 

Andere mochten auch

Potentialist reflection
Potentialist reflectionPotentialist reflection
Potentialist reflectionjamesstudd
 
Math63032modal
Math63032modalMath63032modal
Math63032modalHanibei
 
Translating into Common Logic
Translating into Common LogicTranslating into Common Logic
Translating into Common LogicPat Hayes
 
Bimodal set-theory-cambridge
Bimodal set-theory-cambridgeBimodal set-theory-cambridge
Bimodal set-theory-cambridgejamesstudd
 
Introduction to Logic
Introduction to LogicIntroduction to Logic
Introduction to LogicWasif Altaf
 
Modal Verbs: Advice, Obligation, Permission
Modal Verbs: Advice, Obligation, PermissionModal Verbs: Advice, Obligation, Permission
Modal Verbs: Advice, Obligation, PermissionTanasorn Pajchim
 

Andere mochten auch (11)

Potentialist reflection
Potentialist reflectionPotentialist reflection
Potentialist reflection
 
Math63032modal
Math63032modalMath63032modal
Math63032modal
 
Modal Logic
Modal LogicModal Logic
Modal Logic
 
Translating into Common Logic
Translating into Common LogicTranslating into Common Logic
Translating into Common Logic
 
If, not when
If, not whenIf, not when
If, not when
 
IMLA2011 Opening
IMLA2011 OpeningIMLA2011 Opening
IMLA2011 Opening
 
Bimodal set-theory-cambridge
Bimodal set-theory-cambridgeBimodal set-theory-cambridge
Bimodal set-theory-cambridge
 
Introduction to Logic
Introduction to LogicIntroduction to Logic
Introduction to Logic
 
Modal Verbs: Advice, Obligation, Permission
Modal Verbs: Advice, Obligation, PermissionModal Verbs: Advice, Obligation, Permission
Modal Verbs: Advice, Obligation, Permission
 
MODALS PPT
MODALS PPTMODALS PPT
MODALS PPT
 
Modal Verbs
Modal VerbsModal Verbs
Modal Verbs
 

Ähnlich wie Fun with Constructive Modalities

Logics of Context and Modal Type Theories
Logics of Context and Modal Type TheoriesLogics of Context and Modal Type Theories
Logics of Context and Modal Type TheoriesValeria de Paiva
 
Constructive Description Logics 2006
Constructive Description Logics 2006Constructive Description Logics 2006
Constructive Description Logics 2006Valeria de Paiva
 
Constructive Modal and Linear Logics
Constructive Modal and Linear LogicsConstructive Modal and Linear Logics
Constructive Modal and Linear LogicsValeria de Paiva
 
Equivalence of Logics: the categorical proof theory perspective
Equivalence of Logics: the categorical proof theory perspectiveEquivalence of Logics: the categorical proof theory perspective
Equivalence of Logics: the categorical proof theory perspectiveValeria de Paiva
 
Cognitive Agents with Commonsense - Invited Talk at Istituto Italiano di Tecn...
Cognitive Agents with Commonsense - Invited Talk at Istituto Italiano di Tecn...Cognitive Agents with Commonsense - Invited Talk at Istituto Italiano di Tecn...
Cognitive Agents with Commonsense - Invited Talk at Istituto Italiano di Tecn...Antonio Lieto
 
Lecture 2: Computational Semantics
Lecture 2: Computational SemanticsLecture 2: Computational Semantics
Lecture 2: Computational SemanticsMarina Santini
 
The logic(s) of informal proofs (vub)
The logic(s) of informal proofs (vub)The logic(s) of informal proofs (vub)
The logic(s) of informal proofs (vub)Brendan Larvor
 
The logic(s) of informal proofs (vub)
The logic(s) of informal proofs (vub)The logic(s) of informal proofs (vub)
The logic(s) of informal proofs (vub)Brendan Larvor
 
The logic(s) of informal proofs (tyumen, western siberia 2019)
The logic(s) of informal proofs (tyumen, western siberia 2019)The logic(s) of informal proofs (tyumen, western siberia 2019)
The logic(s) of informal proofs (tyumen, western siberia 2019)Brendan Larvor
 
Jarrar: ORM in Description Logic
Jarrar: ORM in Description Logic  Jarrar: ORM in Description Logic
Jarrar: ORM in Description Logic Mustafa Jarrar
 
Edwardian Proofs as Futuristic Programs
Edwardian Proofs as Futuristic ProgramsEdwardian Proofs as Futuristic Programs
Edwardian Proofs as Futuristic ProgramsValeria de Paiva
 
Constructive Hybrid Logics
Constructive Hybrid LogicsConstructive Hybrid Logics
Constructive Hybrid LogicsValeria de Paiva
 
Like Alice in Wonderland: Unraveling Reasoning and Cognition Using Analogies ...
Like Alice in Wonderland: Unraveling Reasoning and Cognition Using Analogies ...Like Alice in Wonderland: Unraveling Reasoning and Cognition Using Analogies ...
Like Alice in Wonderland: Unraveling Reasoning and Cognition Using Analogies ...Facultad de Informática UCM
 
Different Semantic Perspectives for Question Answering Systems
Different Semantic Perspectives for Question Answering SystemsDifferent Semantic Perspectives for Question Answering Systems
Different Semantic Perspectives for Question Answering SystemsAndre Freitas
 
Functional and Structural Models of Commonsense Reasoning in Cognitive Archit...
Functional and Structural Models of Commonsense Reasoning in Cognitive Archit...Functional and Structural Models of Commonsense Reasoning in Cognitive Archit...
Functional and Structural Models of Commonsense Reasoning in Cognitive Archit...Antonio Lieto
 
A Featherweight Approach to FOOL
A Featherweight Approach to FOOLA Featherweight Approach to FOOL
A Featherweight Approach to FOOLgreenwop
 
A gentle intruduction to category theory
A gentle intruduction to category theoryA gentle intruduction to category theory
A gentle intruduction to category theoryJeff Jampa
 
Lecture 1-3-Logics-In-computer-science.pptx
Lecture 1-3-Logics-In-computer-science.pptxLecture 1-3-Logics-In-computer-science.pptx
Lecture 1-3-Logics-In-computer-science.pptxPriyalMayurManvar
 
Artificial intelligence
Artificial intelligenceArtificial intelligence
Artificial intelligenceEnsaf Atef
 

Ähnlich wie Fun with Constructive Modalities (20)

Logics of Context and Modal Type Theories
Logics of Context and Modal Type TheoriesLogics of Context and Modal Type Theories
Logics of Context and Modal Type Theories
 
Constructive Description Logics 2006
Constructive Description Logics 2006Constructive Description Logics 2006
Constructive Description Logics 2006
 
Constructive Modal and Linear Logics
Constructive Modal and Linear LogicsConstructive Modal and Linear Logics
Constructive Modal and Linear Logics
 
Equivalence of Logics: the categorical proof theory perspective
Equivalence of Logics: the categorical proof theory perspectiveEquivalence of Logics: the categorical proof theory perspective
Equivalence of Logics: the categorical proof theory perspective
 
Cognitive Agents with Commonsense - Invited Talk at Istituto Italiano di Tecn...
Cognitive Agents with Commonsense - Invited Talk at Istituto Italiano di Tecn...Cognitive Agents with Commonsense - Invited Talk at Istituto Italiano di Tecn...
Cognitive Agents with Commonsense - Invited Talk at Istituto Italiano di Tecn...
 
Lecture 2: Computational Semantics
Lecture 2: Computational SemanticsLecture 2: Computational Semantics
Lecture 2: Computational Semantics
 
The logic(s) of informal proofs (vub)
The logic(s) of informal proofs (vub)The logic(s) of informal proofs (vub)
The logic(s) of informal proofs (vub)
 
The logic(s) of informal proofs (vub)
The logic(s) of informal proofs (vub)The logic(s) of informal proofs (vub)
The logic(s) of informal proofs (vub)
 
The logic(s) of informal proofs (tyumen, western siberia 2019)
The logic(s) of informal proofs (tyumen, western siberia 2019)The logic(s) of informal proofs (tyumen, western siberia 2019)
The logic(s) of informal proofs (tyumen, western siberia 2019)
 
Jarrar: ORM in Description Logic
Jarrar: ORM in Description Logic  Jarrar: ORM in Description Logic
Jarrar: ORM in Description Logic
 
Edwardian Proofs as Futuristic Programs
Edwardian Proofs as Futuristic ProgramsEdwardian Proofs as Futuristic Programs
Edwardian Proofs as Futuristic Programs
 
Constructive Hybrid Logics
Constructive Hybrid LogicsConstructive Hybrid Logics
Constructive Hybrid Logics
 
Like Alice in Wonderland: Unraveling Reasoning and Cognition Using Analogies ...
Like Alice in Wonderland: Unraveling Reasoning and Cognition Using Analogies ...Like Alice in Wonderland: Unraveling Reasoning and Cognition Using Analogies ...
Like Alice in Wonderland: Unraveling Reasoning and Cognition Using Analogies ...
 
Different Semantic Perspectives for Question Answering Systems
Different Semantic Perspectives for Question Answering SystemsDifferent Semantic Perspectives for Question Answering Systems
Different Semantic Perspectives for Question Answering Systems
 
Functional and Structural Models of Commonsense Reasoning in Cognitive Archit...
Functional and Structural Models of Commonsense Reasoning in Cognitive Archit...Functional and Structural Models of Commonsense Reasoning in Cognitive Archit...
Functional and Structural Models of Commonsense Reasoning in Cognitive Archit...
 
A Featherweight Approach to FOOL
A Featherweight Approach to FOOLA Featherweight Approach to FOOL
A Featherweight Approach to FOOL
 
A gentle intruduction to category theory
A gentle intruduction to category theoryA gentle intruduction to category theory
A gentle intruduction to category theory
 
AI_Session 20 Horn clause.pptx
AI_Session 20 Horn clause.pptxAI_Session 20 Horn clause.pptx
AI_Session 20 Horn clause.pptx
 
Lecture 1-3-Logics-In-computer-science.pptx
Lecture 1-3-Logics-In-computer-science.pptxLecture 1-3-Logics-In-computer-science.pptx
Lecture 1-3-Logics-In-computer-science.pptx
 
Artificial intelligence
Artificial intelligenceArtificial intelligence
Artificial intelligence
 

Mehr von Valeria de Paiva

Dialectica Categorical Constructions
Dialectica Categorical ConstructionsDialectica Categorical Constructions
Dialectica Categorical ConstructionsValeria de Paiva
 
Logic & Representation 2021
Logic & Representation 2021Logic & Representation 2021
Logic & Representation 2021Valeria de Paiva
 
Dialectica Categories Revisited
Dialectica Categories RevisitedDialectica Categories Revisited
Dialectica Categories RevisitedValeria de Paiva
 
Networked Mathematics: NLP tools for Better Science
Networked Mathematics: NLP tools for Better ScienceNetworked Mathematics: NLP tools for Better Science
Networked Mathematics: NLP tools for Better ScienceValeria de Paiva
 
Problemas de Kolmogorov-Veloso
Problemas de Kolmogorov-VelosoProblemas de Kolmogorov-Veloso
Problemas de Kolmogorov-VelosoValeria de Paiva
 
Natural Language Inference: for Humans and Machines
Natural Language Inference: for Humans and MachinesNatural Language Inference: for Humans and Machines
Natural Language Inference: for Humans and MachinesValeria de Paiva
 
The importance of Being Erneast: Open datasets in Portuguese
The importance of Being Erneast: Open datasets in PortugueseThe importance of Being Erneast: Open datasets in Portuguese
The importance of Being Erneast: Open datasets in PortugueseValeria de Paiva
 
Semantics and Reasoning for NLP, AI and ACT
Semantics and Reasoning for NLP, AI and ACTSemantics and Reasoning for NLP, AI and ACT
Semantics and Reasoning for NLP, AI and ACTValeria de Paiva
 
Logic and Probabilistic Methods for Dialog
Logic and Probabilistic Methods for DialogLogic and Probabilistic Methods for Dialog
Logic and Probabilistic Methods for DialogValeria de Paiva
 
Dialectica and Kolmogorov Problems
Dialectica and Kolmogorov ProblemsDialectica and Kolmogorov Problems
Dialectica and Kolmogorov ProblemsValeria de Paiva
 
Gender Gap in Computing 2014
Gender Gap in Computing 2014Gender Gap in Computing 2014
Gender Gap in Computing 2014Valeria de Paiva
 
Categorical Proof Theory for Everyone
Categorical Proof Theory for EveryoneCategorical Proof Theory for Everyone
Categorical Proof Theory for EveryoneValeria de Paiva
 
Dialectica and Kolmogorov Problems
Dialectica and Kolmogorov ProblemsDialectica and Kolmogorov Problems
Dialectica and Kolmogorov ProblemsValeria de Paiva
 
Linear Logic and Constructive Mathematics, after Shulman
Linear Logic and Constructive Mathematics, after ShulmanLinear Logic and Constructive Mathematics, after Shulman
Linear Logic and Constructive Mathematics, after ShulmanValeria de Paiva
 

Mehr von Valeria de Paiva (18)

Dialectica Comonoids
Dialectica ComonoidsDialectica Comonoids
Dialectica Comonoids
 
Dialectica Categorical Constructions
Dialectica Categorical ConstructionsDialectica Categorical Constructions
Dialectica Categorical Constructions
 
Logic & Representation 2021
Logic & Representation 2021Logic & Representation 2021
Logic & Representation 2021
 
Dialectica Categories Revisited
Dialectica Categories RevisitedDialectica Categories Revisited
Dialectica Categories Revisited
 
PLN para Tod@s
PLN para Tod@sPLN para Tod@s
PLN para Tod@s
 
Networked Mathematics: NLP tools for Better Science
Networked Mathematics: NLP tools for Better ScienceNetworked Mathematics: NLP tools for Better Science
Networked Mathematics: NLP tools for Better Science
 
Problemas de Kolmogorov-Veloso
Problemas de Kolmogorov-VelosoProblemas de Kolmogorov-Veloso
Problemas de Kolmogorov-Veloso
 
Natural Language Inference: for Humans and Machines
Natural Language Inference: for Humans and MachinesNatural Language Inference: for Humans and Machines
Natural Language Inference: for Humans and Machines
 
Dialectica Petri Nets
Dialectica Petri NetsDialectica Petri Nets
Dialectica Petri Nets
 
The importance of Being Erneast: Open datasets in Portuguese
The importance of Being Erneast: Open datasets in PortugueseThe importance of Being Erneast: Open datasets in Portuguese
The importance of Being Erneast: Open datasets in Portuguese
 
Semantics and Reasoning for NLP, AI and ACT
Semantics and Reasoning for NLP, AI and ACTSemantics and Reasoning for NLP, AI and ACT
Semantics and Reasoning for NLP, AI and ACT
 
NLCS 2013 opening slides
NLCS 2013 opening slidesNLCS 2013 opening slides
NLCS 2013 opening slides
 
Logic and Probabilistic Methods for Dialog
Logic and Probabilistic Methods for DialogLogic and Probabilistic Methods for Dialog
Logic and Probabilistic Methods for Dialog
 
Dialectica and Kolmogorov Problems
Dialectica and Kolmogorov ProblemsDialectica and Kolmogorov Problems
Dialectica and Kolmogorov Problems
 
Gender Gap in Computing 2014
Gender Gap in Computing 2014Gender Gap in Computing 2014
Gender Gap in Computing 2014
 
Categorical Proof Theory for Everyone
Categorical Proof Theory for EveryoneCategorical Proof Theory for Everyone
Categorical Proof Theory for Everyone
 
Dialectica and Kolmogorov Problems
Dialectica and Kolmogorov ProblemsDialectica and Kolmogorov Problems
Dialectica and Kolmogorov Problems
 
Linear Logic and Constructive Mathematics, after Shulman
Linear Logic and Constructive Mathematics, after ShulmanLinear Logic and Constructive Mathematics, after Shulman
Linear Logic and Constructive Mathematics, after Shulman
 

Kürzlich hochgeladen

Unraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfUnraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfAlex Barbosa Coqueiro
 
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationBeyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationSafe Software
 
Story boards and shot lists for my a level piece
Story boards and shot lists for my a level pieceStory boards and shot lists for my a level piece
Story boards and shot lists for my a level piececharlottematthew16
 
Bun (KitWorks Team Study 노별마루 발표 2024.4.22)
Bun (KitWorks Team Study 노별마루 발표 2024.4.22)Bun (KitWorks Team Study 노별마루 발표 2024.4.22)
Bun (KitWorks Team Study 노별마루 발표 2024.4.22)Wonjun Hwang
 
DevoxxFR 2024 Reproducible Builds with Apache Maven
DevoxxFR 2024 Reproducible Builds with Apache MavenDevoxxFR 2024 Reproducible Builds with Apache Maven
DevoxxFR 2024 Reproducible Builds with Apache MavenHervé Boutemy
 
Streamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupStreamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupFlorian Wilhelm
 
CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):comworks
 
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks..."LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...Fwdays
 
Commit 2024 - Secret Management made easy
Commit 2024 - Secret Management made easyCommit 2024 - Secret Management made easy
Commit 2024 - Secret Management made easyAlfredo García Lavilla
 
Install Stable Diffusion in windows machine
Install Stable Diffusion in windows machineInstall Stable Diffusion in windows machine
Install Stable Diffusion in windows machinePadma Pradeep
 
Training state-of-the-art general text embedding
Training state-of-the-art general text embeddingTraining state-of-the-art general text embedding
Training state-of-the-art general text embeddingZilliz
 
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek SchlawackFwdays
 
Artificial intelligence in cctv survelliance.pptx
Artificial intelligence in cctv survelliance.pptxArtificial intelligence in cctv survelliance.pptx
Artificial intelligence in cctv survelliance.pptxhariprasad279825
 
Leverage Zilliz Serverless - Up to 50X Saving for Your Vector Storage Cost
Leverage Zilliz Serverless - Up to 50X Saving for Your Vector Storage CostLeverage Zilliz Serverless - Up to 50X Saving for Your Vector Storage Cost
Leverage Zilliz Serverless - Up to 50X Saving for Your Vector Storage CostZilliz
 
SAP Build Work Zone - Overview L2-L3.pptx
SAP Build Work Zone - Overview L2-L3.pptxSAP Build Work Zone - Overview L2-L3.pptx
SAP Build Work Zone - Overview L2-L3.pptxNavinnSomaal
 
"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr Bagan"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr BaganFwdays
 
Developer Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQLDeveloper Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQLScyllaDB
 
Connect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationConnect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationSlibray Presentation
 
Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Scott Keck-Warren
 

Kürzlich hochgeladen (20)

Unraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfUnraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdf
 
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationBeyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
 
Story boards and shot lists for my a level piece
Story boards and shot lists for my a level pieceStory boards and shot lists for my a level piece
Story boards and shot lists for my a level piece
 
Bun (KitWorks Team Study 노별마루 발표 2024.4.22)
Bun (KitWorks Team Study 노별마루 발표 2024.4.22)Bun (KitWorks Team Study 노별마루 발표 2024.4.22)
Bun (KitWorks Team Study 노별마루 발표 2024.4.22)
 
DevoxxFR 2024 Reproducible Builds with Apache Maven
DevoxxFR 2024 Reproducible Builds with Apache MavenDevoxxFR 2024 Reproducible Builds with Apache Maven
DevoxxFR 2024 Reproducible Builds with Apache Maven
 
Streamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupStreamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project Setup
 
CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):
 
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks..."LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
 
Commit 2024 - Secret Management made easy
Commit 2024 - Secret Management made easyCommit 2024 - Secret Management made easy
Commit 2024 - Secret Management made easy
 
Install Stable Diffusion in windows machine
Install Stable Diffusion in windows machineInstall Stable Diffusion in windows machine
Install Stable Diffusion in windows machine
 
Training state-of-the-art general text embedding
Training state-of-the-art general text embeddingTraining state-of-the-art general text embedding
Training state-of-the-art general text embedding
 
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
 
DMCC Future of Trade Web3 - Special Edition
DMCC Future of Trade Web3 - Special EditionDMCC Future of Trade Web3 - Special Edition
DMCC Future of Trade Web3 - Special Edition
 
Artificial intelligence in cctv survelliance.pptx
Artificial intelligence in cctv survelliance.pptxArtificial intelligence in cctv survelliance.pptx
Artificial intelligence in cctv survelliance.pptx
 
Leverage Zilliz Serverless - Up to 50X Saving for Your Vector Storage Cost
Leverage Zilliz Serverless - Up to 50X Saving for Your Vector Storage CostLeverage Zilliz Serverless - Up to 50X Saving for Your Vector Storage Cost
Leverage Zilliz Serverless - Up to 50X Saving for Your Vector Storage Cost
 
SAP Build Work Zone - Overview L2-L3.pptx
SAP Build Work Zone - Overview L2-L3.pptxSAP Build Work Zone - Overview L2-L3.pptx
SAP Build Work Zone - Overview L2-L3.pptx
 
"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr Bagan"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr Bagan
 
Developer Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQLDeveloper Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQL
 
Connect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationConnect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck Presentation
 
Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024
 

Fun with Constructive Modalities

  • 1. Fun with Constructive Modalities Valeria de Paiva Cuil, Inc. PUC Rio de Janeiro, June 2009
  • 2. An applied logician’s job is never done…  When modeling an implemented system as a logic you can start from the system  Or you can start from logics that could fit it  Hopefully the two meet up…
  • 3. This talk: Off-the-shelf logical systems The pieces of the puzzle... – FOL – HOL – Modal logic – Description logic – Hybrid logic – MCS/LMS – Intensional Logic – Etc…
  • 4. Outline  Motivation  Brief history?  Constructive modal logic  Constructive hybrid logic  Constructive description logic  Discussion
  • 5. Motivation: Constructive Modalities?  Modalities and modal logic: the most successful logical framework in CS  Temporal logic, knowledge operators, BDI models, security issues, AI, natural language understanding and inference, databases, etc..  Logic used both to create logical representation of information and to reason about it  Usually classical modalities  What about constructive modalities?
  • 6. Motivation: Constructive Modalities?  Constructive logic: a logical basis for programming via Curry-Howard correspondences  Modalities extremely useful  Constructive modalities twice as useful?  examples from applications abound  Which constructive modalities?  Usual phenomenon: classical facts can be construed in many different ways constructively, choosing is an art...
  • 7. •Constructive reasoning: what, why, how...  What: Reasoning principles that are safer  if I ask you whether “There is x such that P(x)”,  I'm happier with an answer “yes, x_0”, than with an answer “yes, for all x it is not the case that not P(x)”.  Why: want reasoning to be as precise and safe as possible  How: constructive reasoning as much as possible, but classical if need be
  • 8. A brief history  Debates over constructive or classical logics since the beginning of the 20th century  Modal logics from 1920's - Lewis  Kripke-like semantics in the 60s.  Connections constructive/modal logic: – Algebraic McKinsay/Tarski 30s – Kripke semantics, for both 65 – Modal type theories, 90's  Putting constructive and modal together:  Fitch 1948 MIPC, Bull 1966, Prawitz 1965, Curry,
  • 9. More brief history...  Intuitionistic modal logic: – Analogy – Semantics – Translations – Other  Fisher-Servi 80's,  Bozic-Dosen, 84, Volter/Zacharyaschev 88  Simpson, Gabbay, Masini/Martini early 90's  Mendler, Fairtlough, Bierman/dePaiva, etc  Overviews: Goldblatt, IMLA'04 (dePaiva, Mendler, Gore')
  • 10. Constructive modal logics  Basic ideas: – Box, Diamond like forall/exists – Intuitionistic logic like S4-modal logic, – where A-->B = Box A → B – Combining modalities not that easy...  To have ``intuitionistic modal logic” need to have two modalities, how do they interact? – Commuting squares possibilities  Adding syntax: hypersequents, labelled deduction systems, adding semantics to syntax (many ways...)
  • 11. Constructive modal logics  Personal programme:  constructive modal logics with axioms, sequents and natural deduction formulations  Also with algebraic, Kripke and categorical semantics  With translations between formulations and proved equivalences/embeddings  Translating proofs more than simply theorems  broad view of constructive and/or modality
  • 12. Simpson Desiderata for IML '94  IML is a conservative extension of IPL.  IML contains all substitutions instances of theorems of IPL and is closed under modus ponen.  Adding excluded middle to IML yields a standard classical modal logic  If “A or B” is a theorem of IML either A is a theorem or B is a theorem too.  Box and Diamond are independent in IML.  (Intuitionistic) Meaning of the modalities, wrt it IML is sound and complete
  • 13. Extensions: Description and Hybrid Logics  Description and Hybrid logics are closely associated with modal logics  Both classes tend to be classical logics, for the same reasons above  We discuss both constructive hybrid logics (Brauner/dePaiva 03) and constructive description logics (dePaiva05) in turn.
  • 14. Constructive Hybrid Logic?  What are hybrid logics?  Extension of modal logic, where we make part of the syntax of the formulae the worlds at which they're evaluated.  Add to basic modal logic second kind of propositional symbols (nominals) and satisfaction operators  A nominal is assumed to be true at exactly one world  A formula like a:A where a is a nominal and A is a formula is called a satisfaction statement
  • 15. Constructive Hybrid Logic!  Brauner/dePaiva ('03, '05)  Which kind of constructive?  Depends on kind of constructive modal logic  Many choices for syntax and for models.  Our choice: modal base Simpson-style, Natural Deduction style.  Results: IHL as a ND system, models, soundness and completeness, extensions to geometric theories  Open problem: hybrid system CK style?...
  • 16. What Are Description Logics?  A family of logic based Knowledge Representation formalisms – Descendants of semantic networks and KL-ONE – Describe domain in terms of concepts (classes), roles (properties, relationships) and individuals  Distinguished by: – Formal semantics (typically model theoretic) » Decidable fragments of FOL (often contained in C2) » Closely related to Propositional Modal, Hybrid & Dynamic Logics » Closely related to Guarded Fragment – Provision of inference services » Decision procedures for key problems (satisfiability, subsumption, etc) » Implemented systems (highly optimised) Thanks Ian Horrocks!
  • 17. DL Basics  Concepts (formulae/unary predicates) – E.g., Person, Doctor, HappyParent, etc.  Roles (modalities/relations) – E.g., hasChild, loves  Individuals (nominals/constants) – E.g., John, Mary, Italy  Operators (for forming concepts and roles) restricted so that: – Satisfiability/subsumption is decidable and, if possible, of low complexity – No need for explicit use of variables – Features such as counting (graded modalities) succinctly expressed
  • 18. What are description logics?  A sublogic of FOL?  Or a sublogic of Modal logic? FOL t1 ALC st t2 Kn
  • 19. Constructive Description Logic via Translation  DL can be defined via t1 translation into FOL  To constructivize it transform FOL into IFOL Call system IALC  DL can be defined via t2 translation into multimodal K (Schilds91)  Need to choose a constructive K  Using IK (Simpson) call system iALC, using CK (Mendler & de Paiva) call system cALC
  • 20. Two translations  Into first-order logic t1:ALC → FOL  concept C maps to C(x), role R maps to relation, quantifiers the point  Into modal logic t2:ALC → Kn, roles into boxes, diamonds
  • 21. Constructive Description Logic: IALC  Basic idea: translate description syntax using t1 into IFOL, instead of FOL  No excluded middle, no duality between existential and universal quantifiers, no duality between conjunction and disjunction  Pros: IFOL fairly standard – Can provide IALC models easily  Cons: semantics of IFOL more complicated…  Result: Given IALC model M, given formula Am M satisfies A iff M satisfies t1(Α), that is t1 is truth-preserving translation
  • 22. Constructive Description Logic: iALC and cALC  Basic idea: translate description syntax using t2 into constructive modal logic, instead of classical modal Kn.  Which constructive K?  If Simpson’s IK iALC,  if Mendler/de Paiva CK cALC  Difference: distribution of possibility over disjunction and nullary one:  Dia (A or B) → Dia A or Dia B  Dia (false) → false
  • 23. Constructive Description Logic II: iALC  Note that translation t2 into constructive modal logic is the same for both iALC and cALC, just the target language change.  For iALC, can use our work on intuitionistic hybrid logic  Models easily described  Framework: several modal logics + geometric theories  Referee’s remark: complexity?
  • 24. Constructive Description Logic II: cALC  For cALC, can use our work on an extended Curry-Howard isomorphism for constructive modal logic  No Framework: can only do S4 and K  Can do Kripke models and categorical models  Haven’t investigated interpolation, decidability or complexity  New work by Mendler and Schiele
  • 25. Related Work  Mendler/Schiele on constructive description for auditing  Bozzato, Ferrari et al, CHI for ALC, diff HH and A Rademaker?  Odintsov and Wansing’s “Inconsistent- tolerant description logic I and II” – Motivation is paraconsistency, not constructivity  Hofmann’s “Proof theoretical Approach to DL” – Motivation fixpoints in description logics and their complexity  Straccia’s and Patel-Schneider’s papers on 4- valued description logic – Motivations are fuzziness and uncertainty
  • 26. Discussion  This is very preliminary  While it is true that constructive reasoning multiply concepts, there should be criteria to identify best system(s?)  Part of bigger programme of constructivizing logics for computer science  Want to keep criteria both from theory and applications  Next steps: criteria from modal/hybrid logic, bisimulations, complexity bounds, temporal logics, etc…
  • 27. References  Natural Deduction and Context as (Constructive) Modality (V. de Paiva). In Proceedings of the 4th International and Interdisciplinary Conference CONTEXT 2003, Stanford, CA, USA, Springer Lecture Notes in Artificial Intelligence, vol 2680, 2003.  Constructive CK for Contexts (M. Mendler, V de Paiva), In Proceedings of the Worskhop on Context Representation and Reasoning, Paris, France, July 2005.  Intuitionistic Hybrid Logic (T. Brauner, V. de Paiva), Presented at Methods for Modalities 3, LORIA, Nancy, France, September 22-23, 2003. Full paper in Journal of Applied Logic 2005  .Modalities in Constructive Logics and Type Theories Preface to the special issue on Intuitionistic Modal Logic and Application of the Journal of Logic and Computation, volume 14, number 4, August 2004. Guest Editors: Valeria de Paiva, Rajeev Gore' and Michael Mendler.  Constructive Description Logics: what, why and how. (extended draft) Presented at Context Representation and Reasoning, Riva del Garda, August 2006.