SlideShare a Scribd company logo
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

More Related Content

What's hot

Constructive Modalities
Constructive ModalitiesConstructive Modalities
Constructive Modalities
Valeria de Paiva
 
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 Substitutions
Valeria 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 role
Valeria 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 Theory
Valeria de Paiva
 
Dialectica Comonads
Dialectica ComonadsDialectica Comonads
Dialectica Comonads
Valeria de Paiva
 
Dialectica amongst friends
Dialectica amongst friendsDialectica amongst friends
Dialectica amongst friends
Valeria de Paiva
 
Relevant Dialectica Categories
Relevant Dialectica CategoriesRelevant Dialectica Categories
Relevant Dialectica Categories
Valeria de Paiva
 
Constructive Modal Logics, Once Again
Constructive Modal Logics, Once AgainConstructive Modal Logics, Once Again
Constructive Modal Logics, Once Again
Valeria de Paiva
 
Dialectica Categories for the Lambek Calculus
Dialectica Categories for the Lambek CalculusDialectica Categories for the Lambek Calculus
Dialectica Categories for the Lambek Calculus
Valeria de Paiva
 
Dialectica Categories and Petri Nets
Dialectica Categories and Petri NetsDialectica Categories and Petri Nets
Dialectica Categories and Petri Nets
Valeria 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 Paiva
Valeria de Paiva
 
Dialectica Categories and Petri Nets
Dialectica Categories and Petri NetsDialectica Categories and Petri Nets
Dialectica Categories and Petri Nets
Valeria 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 Paiva
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
Valeria de Paiva
 
Negation in the Ecumenical System
Negation in the Ecumenical SystemNegation in the Ecumenical System
Negation in the Ecumenical System
Valeria 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 role
Valeria de Paiva
 
Dialectica Categories: the mathematical version
Dialectica Categories: the mathematical versionDialectica Categories: the mathematical version
Dialectica Categories: the mathematical version
Valeria de Paiva
 
Benchmarking Linear Logic Proofs
Benchmarking Linear Logic ProofsBenchmarking Linear Logic Proofs
Benchmarking Linear Logic Proofs
Valeria de Paiva
 
Benchmarking Linear Logic Proofs
Benchmarking Linear Logic ProofsBenchmarking Linear Logic Proofs
Benchmarking Linear Logic Proofs
Valeria de Paiva
 

What's hot (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
 

Viewers also liked

Potentialist reflection
Potentialist reflectionPotentialist reflection
Potentialist reflectionjamesstudd
 
Math63032modal
Math63032modalMath63032modal
Math63032modalHanibei
 
Modal Logic
Modal LogicModal Logic
Modal Logic
Serge Garlatti
 
Translating into Common Logic
Translating into Common LogicTranslating into Common Logic
Translating into Common Logic
Pat Hayes
 
If, not when
If, not whenIf, not when
If, not when
Valeria de Paiva
 
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 Logic
Wasif Altaf
 
Modal Verbs: Advice, Obligation, Permission
Modal Verbs: Advice, Obligation, PermissionModal Verbs: Advice, Obligation, Permission
Modal Verbs: Advice, Obligation, Permission
Tanasorn Pajchim
 
MODALS PPT
MODALS PPTMODALS PPT
MODALS PPT
Nehala Mohd Shafi
 

Viewers also liked (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
 

Similar to 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 Theories
Valeria 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 Logics
Valeria 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 perspective
Valeria 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 Semantics
Marina 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
 
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 Systems
Andre 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 FOOL
greenwop
 
A gentle intruduction to category theory
A gentle intruduction to category theoryA gentle intruduction to category theory
A gentle intruduction to category theoryJeff Jampa
 
AI_Session 20 Horn clause.pptx
AI_Session 20 Horn clause.pptxAI_Session 20 Horn clause.pptx
AI_Session 20 Horn clause.pptx
Asst.prof M.Gokilavani
 
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
PriyalMayurManvar
 
Artificial intelligence
Artificial intelligenceArtificial intelligence
Artificial intelligence
Ensaf Atef
 
Robustness in Machine Learning Explanations Does It Matter-1.pdf
Robustness in Machine Learning Explanations Does It Matter-1.pdfRobustness in Machine Learning Explanations Does It Matter-1.pdf
Robustness in Machine Learning Explanations Does It Matter-1.pdf
Daniel983829
 

Similar to 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
 
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
 
Robustness in Machine Learning Explanations Does It Matter-1.pdf
Robustness in Machine Learning Explanations Does It Matter-1.pdfRobustness in Machine Learning Explanations Does It Matter-1.pdf
Robustness in Machine Learning Explanations Does It Matter-1.pdf
 

More from Valeria de Paiva

Dialectica Comonoids
Dialectica ComonoidsDialectica Comonoids
Dialectica Comonoids
Valeria de Paiva
 
Dialectica Categorical Constructions
Dialectica Categorical ConstructionsDialectica Categorical Constructions
Dialectica Categorical Constructions
Valeria de Paiva
 
Logic & Representation 2021
Logic & Representation 2021Logic & Representation 2021
Logic & Representation 2021
Valeria de Paiva
 
Dialectica Categories Revisited
Dialectica Categories RevisitedDialectica Categories Revisited
Dialectica Categories Revisited
Valeria de Paiva
 
PLN para Tod@s
PLN para Tod@sPLN para Tod@s
PLN para Tod@s
Valeria 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 Science
Valeria de Paiva
 
Problemas de Kolmogorov-Veloso
Problemas de Kolmogorov-VelosoProblemas de Kolmogorov-Veloso
Problemas de Kolmogorov-Veloso
Valeria 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 Machines
Valeria de Paiva
 
Dialectica Petri Nets
Dialectica Petri NetsDialectica Petri Nets
Dialectica Petri Nets
Valeria 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 Portuguese
Valeria 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 ACT
Valeria de Paiva
 
NLCS 2013 opening slides
NLCS 2013 opening slidesNLCS 2013 opening slides
NLCS 2013 opening slides
Valeria de Paiva
 
Logic and Probabilistic Methods for Dialog
Logic and Probabilistic Methods for DialogLogic and Probabilistic Methods for Dialog
Logic and Probabilistic Methods for Dialog
Valeria de Paiva
 
Dialectica and Kolmogorov Problems
Dialectica and Kolmogorov ProblemsDialectica and Kolmogorov Problems
Dialectica and Kolmogorov Problems
Valeria de Paiva
 
Gender Gap in Computing 2014
Gender Gap in Computing 2014Gender Gap in Computing 2014
Gender Gap in Computing 2014
Valeria de Paiva
 
Categorical Proof Theory for Everyone
Categorical Proof Theory for EveryoneCategorical Proof Theory for Everyone
Categorical Proof Theory for Everyone
Valeria de Paiva
 
Dialectica and Kolmogorov Problems
Dialectica and Kolmogorov ProblemsDialectica and Kolmogorov Problems
Dialectica and Kolmogorov Problems
Valeria 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 Shulman
Valeria de Paiva
 

More from 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
 

Recently uploaded

State of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 previewState of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
Prayukth K V
 
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
DanBrown980551
 
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
sonjaschweigert1
 
RESUME BUILDER APPLICATION Project for students
RESUME BUILDER APPLICATION Project for studentsRESUME BUILDER APPLICATION Project for students
RESUME BUILDER APPLICATION Project for students
KAMESHS29
 
Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !
KatiaHIMEUR1
 
By Design, not by Accident - Agile Venture Bolzano 2024
By Design, not by Accident - Agile Venture Bolzano 2024By Design, not by Accident - Agile Venture Bolzano 2024
By Design, not by Accident - Agile Venture Bolzano 2024
Pierluigi Pugliese
 
Free Complete Python - A step towards Data Science
Free Complete Python - A step towards Data ScienceFree Complete Python - A step towards Data Science
Free Complete Python - A step towards Data Science
RinaMondal9
 
GraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge GraphGraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge Graph
Guy Korland
 
Essentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FMEEssentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FME
Safe Software
 
Enhancing Performance with Globus and the Science DMZ
Enhancing Performance with Globus and the Science DMZEnhancing Performance with Globus and the Science DMZ
Enhancing Performance with Globus and the Science DMZ
Globus
 
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™
UiPathCommunity
 
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfSAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
Peter Spielvogel
 
Pushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 daysPushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 days
Adtran
 
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdfFIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance
 
FIDO Alliance Osaka Seminar: FIDO Security Aspects.pdf
FIDO Alliance Osaka Seminar: FIDO Security Aspects.pdfFIDO Alliance Osaka Seminar: FIDO Security Aspects.pdf
FIDO Alliance Osaka Seminar: FIDO Security Aspects.pdf
FIDO Alliance
 
Quantum Computing: Current Landscape and the Future Role of APIs
Quantum Computing: Current Landscape and the Future Role of APIsQuantum Computing: Current Landscape and the Future Role of APIs
Quantum Computing: Current Landscape and the Future Role of APIs
Vlad Stirbu
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
UiPathCommunity
 
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfObservability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Paige Cruz
 
FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf
FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdfFIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf
FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf
FIDO Alliance
 
Elizabeth Buie - Older adults: Are we really designing for our future selves?
Elizabeth Buie - Older adults: Are we really designing for our future selves?Elizabeth Buie - Older adults: Are we really designing for our future selves?
Elizabeth Buie - Older adults: Are we really designing for our future selves?
Nexer Digital
 

Recently uploaded (20)

State of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 previewState of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
 
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
 
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
 
RESUME BUILDER APPLICATION Project for students
RESUME BUILDER APPLICATION Project for studentsRESUME BUILDER APPLICATION Project for students
RESUME BUILDER APPLICATION Project for students
 
Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !
 
By Design, not by Accident - Agile Venture Bolzano 2024
By Design, not by Accident - Agile Venture Bolzano 2024By Design, not by Accident - Agile Venture Bolzano 2024
By Design, not by Accident - Agile Venture Bolzano 2024
 
Free Complete Python - A step towards Data Science
Free Complete Python - A step towards Data ScienceFree Complete Python - A step towards Data Science
Free Complete Python - A step towards Data Science
 
GraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge GraphGraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge Graph
 
Essentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FMEEssentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FME
 
Enhancing Performance with Globus and the Science DMZ
Enhancing Performance with Globus and the Science DMZEnhancing Performance with Globus and the Science DMZ
Enhancing Performance with Globus and the Science DMZ
 
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™
 
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfSAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
 
Pushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 daysPushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 days
 
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdfFIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
 
FIDO Alliance Osaka Seminar: FIDO Security Aspects.pdf
FIDO Alliance Osaka Seminar: FIDO Security Aspects.pdfFIDO Alliance Osaka Seminar: FIDO Security Aspects.pdf
FIDO Alliance Osaka Seminar: FIDO Security Aspects.pdf
 
Quantum Computing: Current Landscape and the Future Role of APIs
Quantum Computing: Current Landscape and the Future Role of APIsQuantum Computing: Current Landscape and the Future Role of APIs
Quantum Computing: Current Landscape and the Future Role of APIs
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
 
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfObservability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
 
FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf
FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdfFIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf
FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf
 
Elizabeth Buie - Older adults: Are we really designing for our future selves?
Elizabeth Buie - Older adults: Are we really designing for our future selves?Elizabeth Buie - Older adults: Are we really designing for our future selves?
Elizabeth Buie - Older adults: Are we really designing for our future selves?
 

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.