introduction
play

Introduction Unification problem in a logical system L Given a - PowerPoint PPT Presentation

Nov 03, 2023 •140 likes •491 views

Unification in modal logic Alt 1 Philippe Balbiani 1 and Tinko Tinchev 2 1 Institut de recherche en informatique de Toulouse CNRS Universit e de Toulouse 2 Department of Mathematical Logic and Applications Sofia University Introduction

  1. Unification in modal logic Alt 1 Philippe Balbiani 1 and Tinko Tinchev 2 1 Institut de recherche en informatique de Toulouse CNRS — Universit´ e de Toulouse 2 Department of Mathematical Logic and Applications Sofia University

  2. Introduction Unification problem in a logical system L ◮ Given a formula ψ ( x 1 , . . . , x n ) ◮ Determine whether there exists formulas ϕ 1 , . . . , ϕ n such that ψ ( ϕ 1 , . . . , ϕ n ) is in L Admissibility problem in a logical system L ◮ Given a rule of inference ϕ 1 ( x 1 ,..., x n ) ,...,ϕ m ( x 1 ,..., x n ) ψ ( x 1 ,..., x n ) ◮ Determine whether for all formulas χ 1 , . . . , χ n , if ϕ 1 ( χ 1 , . . . , χ n ) , . . . , ϕ m ( χ 1 , . . . , χ n ) are in L then ψ ( χ 1 , . . . , χ n ) is in L

  3. Introduction Rybakov (1984) ◮ The admissibility problem in IPL and S 4 is decidable Chagrov (1992) ◮ There exists a decidable normal modal logic with an undecidable admissibility problem Ghilardi (1999, 2000) ◮ IPL , K 4, etc have a finitary unification type Wolter and Zakharyaschev (2008) ◮ The unification problem for any normal modal logic between K U and K 4 U is undecidable

  4. Introduction Chagrov (1992) ◮ There exists a decidable normal modal logic with an undecidable admissibility problem Proof: For all integers m , n , let F ( m , n ) be the frame

  5. Introduction Chagrov (1992) ◮ There exists a decidable normal modal logic with an undecidable admissibility problem Proof: ◮ For all integers m , n , let F ( m , n ) be the frame . . . ◮ For all sets S of pairs of integers, let L ( S ) = Log {F ( m , n ) : ( m − 1 2 , n − 1 2 ) �∈ S } ◮ If S is recursive then L ( S ) -membership is decidable ◮ If Pr 2 S is nonrecursive then L ( S ) -admissibility is undecidable

  6. Introduction Other frames F ( P , a ) associated to a Minsky program P and a configuration a Chagrov, A. Undecidable properties of extensions of the logic of provability. Algebra i Logika 29 (1990) 350–367.

  7. Introduction Other frames F ( P , a ) associated to a Minsky program P and a configuration a Chagrov, A., Zakharyaschev, M. The undecidability of the disjunction property of propositional logics and other related problems. The Journal of Symbolic Logic 58 (1993) 967–1002.

  8. Introduction Other frames F ( P , a ) associated to a Minsky program P and a configuration a Chagrov, A., Chagrova, L. The truth about algorithmic problems in correspondence theory. In: Advances in Modal Logic. Vol. 6. College Publications (2006) 121–138.

  9. Introduction Other frames F ( P ) associated to a Minsky program P Isard, S. A finitely axiomatizable undecidable extension of K. Theoria 43 (1977) 195–202.

  10. Introduction Wolter and Zakharyaschev (2008) ◮ The unification problem for any normal modal logic between K U and K 4 U is undecidable Proof: Let P be a Minsky program, a = ( s , m , n ) be a configuration and F ( P , a ) be the frame

  11. Introduction Wolter and Zakharyaschev (2008) ◮ The unification problem for any normal modal logic between K U and K 4 U is undecidable Proof: ◮ Let P be a Minsky program, a = ( s , m , n ) be a configuration and F ( P , a ) be the frame . . . ◮ Let α , β , etc be formulas characterizing the points in F ( P , a ) ◮ With each configuration b , associate a modal formula ψ ( b ) ◮ If K U ⊆ L ⊆ K 4 U then P : a → b iff ψ ( b ) is unifiable in L

  12. Introduction Unification problem in a logical system L ◮ Given a formula ψ ( x 1 , . . . , x n ) ◮ Determine whether there exists formulas ϕ 1 , . . . , ϕ n such that ψ ( ϕ 1 , . . . , ϕ n ) is in L Example: � x ∨ � ¬ x is unifiable in all normal logics ◮ K (class of all frames) ◮ KD (class of all serial frames) ◮ K 4 (class of all transitive frames) ◮ S 4 (class of all reflexive transitive frames) ◮ S 5 (class of all partitions)

  13. Introduction Computability and type of unification in L L Computability Type K ? Nullary KD NP -complete ? K 4 Decidable Finitary KD 4 NP -complete Finitary K 45 NP -complete Unitary KD 45 NP -complete Unitary S 4 NP -complete Finitary S 5 NP -complete Unitary S 4 . 3 NP -complete Unitary

  14. Introduction Our results ◮ The unification problem in Alt 1 is decidable ( PSPACE ) ◮ Alt 1 has a nullary unification type

  15. Normal logics: syntax and semantics Syntax ◮ ϕ ::= x | ⊥ | ¬ ϕ | ( ϕ ∨ ψ ) | � ϕ Semantics ◮ M = ( W , R , V ) where ◮ W � = ∅ ◮ R ⊆ W × W ◮ for all variables x , V ( x ) ⊆ W Truth-conditions ◮ M , s | = x iff s ∈ V ( x ) ◮ M , s | = � ϕ iff for all t ∈ W , if sRt then M , t | = ϕ

  16. Normal logics: unification in L Substitutions ◮ σ : variable x �→ formula σ ( x ) Composition of substitutions ◮ σ ◦ τ : variable x �→ formula τ ( σ ( x )) Equivalence relation between substitutions ◮ σ ≃ L τ iff for all variables x , σ ( x ) ↔ τ ( x ) ∈ L Partial order between substitutions ◮ σ � L τ iff there exists a substitution µ such that σ ◦ µ ≃ L τ

  17. Normal logics: unification in L Unifiers ◮ A substitution σ is a unifier of a formula ϕ iff σ ( ϕ ) ∈ L Complete sets of unifiers ◮ A set Σ of unifiers of a formula ϕ is complete iff ◮ For all unifiers τ of ϕ , there exists a unifier σ of ϕ in Σ such that σ � L τ Important questions ◮ Given a formula, has it a unifier? ◮ If so, has it a minimal complete set of unifiers? ◮ If so, how large is this set?

  18. Why unification is NP -complete when KD ⊆ L Computability and type of unification in L L Computability Type K ? Nullary KD NP -complete ? K 4 Decidable Finitary KD 4 NP -complete Finitary K 45 NP -complete Unitary KD 45 NP -complete Unitary S 4 NP -complete Finitary S 5 NP -complete Unitary S 4 . 3 NP -complete Unitary

  19. Why unification is NP -complete when KD ⊆ L Proposition: If KD ⊆ L , unification in L is NP -complete Proof: ◮ A substitution σ is ground if it replaces each variable by a variable-free formula ◮ If a formula has a unifier then it has a ground unifier ◮ Since ♦ ⊤ ∈ L , therefore there are only two non-equivalent variable-free formulas: ⊥ and ⊤ ◮ Thus, to decide whether a formula has a unifier, it suffices to check whether any of the ground substitutions makes it equivalent to ⊤ (which can be done in polynomial time)

  20. Why unification is nullary in K Computability and type of unification in L L Computability Type K ? Nullary KD NP -complete ? K 4 Decidable Finitary KD 4 NP -complete Finitary K 45 NP -complete Unitary KD 45 NP -complete Unitary S 4 NP -complete Finitary S 5 NP -complete Unitary S 4 . 3 NP -complete Unitary

  21. Why unification is nullary in K Proposition: The formula ϕ = x → � x has no minimal complete set of unifiers Proof: ◮ The following substitutions are unifiers of ϕ ◮ σ ⊤ ( x ) = ⊤ ◮ σ i ( x ) = � < i x ∧ � i ⊥ ◮ If i ≤ j then σ j � K σ i ◮ If i < j then σ i �� K σ j ◮ If τ is a unifier of ϕ then either σ ⊤ � K τ , or σ i � K τ when deg ( τ ( x )) ≤ i Je˘ r´ abek, E. Blending margins: the modal logic K has nullary unification type. Journal of Logic and Computation 25 (2015) 1231–1240.

  22. Why unification is decidable and finitary in K 4 Computability and type of unification in L L Computability Type K ? Nullary KD NP -complete ? K 4 Decidable Finitary KD 4 NP -complete Finitary K 45 NP -complete Unitary KD 45 NP -complete Unitary S 4 NP -complete Finitary S 5 NP -complete Unitary S 4 . 3 NP -complete Unitary

  23. Why unification is decidable and finitary in K 4 A formula ϕ is projective if it has a unifier σ such that ◮ ϕ ∧ � ϕ → ( σ ( x ) ↔ x ) ∈ K 4 Remark ◮ Such unifier is a most general unifier of ϕ Proposition: The projectivity problem in K 4 is decidable Proposition If the substitution σ is a unifier of the formula ϕ then there exists a projective formula ψ , depth ( ψ ) ≤ depth ( ϕ ) , such that ◮ σ is a unifier of ψ ◮ ψ ∧ � ψ → ϕ ∈ K 4 Ghilardi, S. Best solving modal equations. Annals of Pure and Applied Logic 102 (2000) 183–198.

  24. Why unification is unitary in S 5 Computability and type of unification in L L Computability Type K ? Nullary KD NP -complete ? K 4 Decidable Finitary KD 4 NP -complete Finitary K 45 NP -complete Unitary KD 45 NP -complete Unitary S 4 NP -complete Finitary S 5 NP -complete Unitary S 4 . 3 NP -complete Unitary

  25. Why unification is unitary in S 5 Proposition: If a formula has a unifier then it has a most general unifier Proof: ◮ Let σ be a unifier of ϕ ◮ Let τ be the following “L¨ owenheim” substitution ◮ τ ( x ) = ( � ϕ ∧ x ) ∨ ( ♦ ¬ ϕ ∧ σ ( x )) ◮ � ϕ → ( τ ( ψ ) ↔ ψ ) ∈ S 5 ◮ ♦ ¬ ϕ → ( τ ( ψ ) ↔ σ ( ψ )) ∈ S 5 ◮ τ is a unifier of ϕ ◮ If µ is a unifier of ϕ then τ � S 5 µ ◮ Thus, τ is a most general unifier of ϕ Baader, F., Ghilardi, S. Unification in modal and description logics. Logic Journal of the IGPL 19 (2011) 705–730.

  26. Normal logic Alt 1 : syntax and semantics Syntax ◮ ϕ ::= x | ⊥ | ¬ ϕ | ( ϕ ∨ ψ ) | � ϕ Semantics ◮ Class of all deterministic frames Axiomatization ◮ K + ♦ x → � x Computability ◮ co NP -complete

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION

INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION

TRAINING COURSE ON SOCIAL PROTECTION &amp; FORMALIZATION TRINIDAD AND TOBAGO MARCH 15, 2017 INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION Design of the NIS Assistance from the

547 views • 23 slides
INTRODUCTION Introduction 2/42 INTRODUCTION Alternations I am giving bread to the

INTRODUCTION Introduction 2/42 INTRODUCTION Alternations I am giving bread to the

Patterns of variation in the expression of case and agreement Andrs Brny Leiden University Centre for Linguistics 9 November 2019, BaSIS Workshop a.barany@hum.leidenuniv.nl INTRODUCTION Introduction 2/42 INTRODUCTION

1.37k views • 42 slides
Introduction Introduction Introduction Introduction Outline Motivation Failures

Introduction Introduction Introduction Introduction Outline Motivation Failures

Introduction Introduction Introduction Introduction Outline Motivation Failures Definition and concepts Process and product properties Principles SE Approaches Motivation Software and the economy The economies of

1.03k views • 49 slides
Introduction Introduction Introduction Nationwide Cause for Concern 1

Introduction Introduction Introduction Nationwide Cause for Concern 1

Introduction Introduction Introduction Nationwide Cause for Concern 1 https://www.cdc.gov/std/stats17/infographic.htm Introduction Epidemiology in Western Colorado CPHE Surveillance Data Report, May 2018 Chlamydia Epidemiology in Western

977 views • 39 slides
DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every

DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every

DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every meeting (2) Some ideas of diagrams for section 7.1 (Introduction) of TP. Giles Barr 25 Jan 2018, Pembroke College On DUNE, the reality is there is a

474 views • 10 slides
INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT

INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT

ADVANCED COMPUTER SECURITY INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT IS SECURITY? A systems security policies describe What the system is supposed to do Store and provide access

479 views • 16 slides
Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL

Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL

Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL Writing a SMIL file Adding Media Objects Martin Halvey Clipping media files January 2008 Timing and Synchronising Layout World Wide

387 views • 14 slides
14 Introduction Introduction Bad guys can put malware into Example: hosts

14 Introduction Introduction Bad guys can put malware into Example: hosts

Introduction Introduction source Encapsulation ISO/OSI reference model message M application segment H t H t M transport network datagram H n H n H t M presentation: allow applications to frame link H l H n H t M interpret

583 views • 4 slides
Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL

Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL

Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL Writing a SMIL file Adding Media Objects Martin Halvey Clipping media files January 2008 Timing and Synchronising Layout

322 views • 8 slides
Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL

Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL

Introduction Zynq Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL Processing System Processor Peripherals Data Buses AXI Bus Conclusion BTE5380 - Embedded Systems Octobre 2014 Andreas Habegger

1.81k views • 30 slides
2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04

2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04

2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04 Project References S E 5 PART.1 SMILE5 Introduction M I L Introduction STORION-SMILE5 Residential Energy Storage System Inverter 5kW Output Input

1.06k views • 25 slides
Introduction to CICS Course introduction Course introduction What is CICS? What is an

Introduction to CICS Course introduction Course introduction What is CICS? What is an

Introduction to CICS Course introduction Course introduction What is CICS? What is an application server? Why use an application server? Course introduction Services provided by CICS How CICS applications are defined Scaling CICS to meet

1.84k views • 146 slides
Network Visualization Introduction Presented by Shahed Introduction Introduction Basic

Network Visualization Introduction Presented by Shahed Introduction Introduction Basic

Network Visualization Introduction Presented by Shahed Introduction Introduction Basic building blocks Node Links (relationship between nodes) Spatial information Network data

584 views • 9 slides
Introduction Introduction (1) Main argument of the paper: universities are not only

Introduction Introduction (1) Main argument of the paper: universities are not only

Le jugement des pairs comme outil de management des universits Peer-review as a management tool Christine Musselin (CSO, Sciences Po et CNRS) Avril 2013, Lirrsistible ascension du capitalisme acadmique Introduction Introduction (1)

590 views • 28 slides
Introduction Introduction to storage and to storage and filesystems filesystems Introduction

Introduction Introduction to storage and to storage and filesystems filesystems Introduction

Moreno Baricevic Gilberto Daz Axel Kohlmeyer Stefano Cozzini ULA ICTP CNR-IOM DEMOCRITOS Merida, VENEZUELA Trieste, ITALY Trieste, ITALY Introduction Introduction to storage and to storage and filesystems filesystems Introduction

1.19k views • 51 slides
JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of

JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of

JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of the brand new JA-100 alarm system Visions Basic architecture System components Setting Help us with final validations You are the FIRST ones

1.69k views • 111 slides
How Can I Help? : Zero-Shot Multi-Modal Automation with QA Michael Du, Sam Masling Nancy Xu The

How Can I Help? : Zero-Shot Multi-Modal Automation with QA Michael Du, Sam Masling Nancy Xu The

How Can I Help? : Zero-Shot Multi-Modal Automation with QA Michael Du, Sam Masling Nancy Xu The Average American Spends 6hrs/day on the Internet - Imagine an agent automated some of those tasks. And we spent less time! - Virtual Personal

310 views • 9 slides
Axiomatic classes of models in modal logics Evgeny Zolin Moscow State University Workshop on

Axiomatic classes of models in modal logics Evgeny Zolin Moscow State University Workshop on

Axiomatic classes of models in modal logics Evgeny Zolin Moscow State University Workshop on Proof Theory, Modal Logic and Reflection Principles (Wormshop 2017) Steklov Mathematical Institute, Moscow October 20, 2017 Evgeny Zolin Axiomatic

589 views • 58 slides
Connecting the categorical and the modal logic approaches to Quantum Mechanics Giovanni Cin` a

Connecting the categorical and the modal logic approaches to Quantum Mechanics Giovanni Cin` a

Categorical Quantum Mechanics Dynamic Quantum Logic Modal logics for small categories Logics for FdHil Connecting the categorical and the modal logic approaches to Quantum Mechanics Giovanni Cin` a based on MSc thesis supervised by A. Baltag

723 views • 34 slides
The modal -calculus Hierarchy on Restricted Classes of Transition Systems Luca Alberucci 1

The modal -calculus Hierarchy on Restricted Classes of Transition Systems Luca Alberucci 1

The modal -calculus Hierarchy on Restricted Classes of Transition Systems The modal -calculus Hierarchy on Restricted Classes of Transition Systems Luca Alberucci 1 Alessandro Facchini 2 1 IAM, University of Berne 2 Universities of Lausanne

1.39k views • 82 slides
Overview/Questions Creating a GUI application which uses multiple windows working together.

Overview/Questions Creating a GUI application which uses multiple windows working together.

CS108 Lecture 31: Graphical User Interface: Multiple Window GUIs Aaron Stevens 17 April 2009 1 Overview/Questions Creating a GUI application which uses multiple windows working together. Developing a parent/child relationship

421 views • 7 slides
Stable Canonical Rules and Admissibility I Nick Bezhanishvili Institute for Logic, Language and

Stable Canonical Rules and Admissibility I Nick Bezhanishvili Institute for Logic, Language and

Stable Canonical Rules and Admissibility I Nick Bezhanishvili Institute for Logic, Language and Computation University of Amsterdam http://www.phil.uu.nl/~bezhanishvili and Silvio Ghilardi Department of Mathematics University of Milan

1.23k views • 111 slides
The expressive power of modal logic with inclusion atoms Johanna Stumpf Dagstuhl Seminar 24.

The expressive power of modal logic with inclusion atoms Johanna Stumpf Dagstuhl Seminar 24.

Modal logic Team Semantics Nonempty disjunction Inclusion atoms Translation The expressive power of modal logic with inclusion atoms Johanna Stumpf Dagstuhl Seminar 24. Juni 2015 Modal logic Team Semantics Nonempty disjunction Inclusion

639 views • 40 slides
Tense, Aspect, Modality, and Attitudes Lecture 6 - 25 July 2017 Introduction Reminders:

Tense, Aspect, Modality, and Attitudes Lecture 6 - 25 July 2017 Introduction Reminders:

Tense, Aspect, Modality, and Attitudes Lecture 6 - 25 July 2017 Introduction Reminders: Meanings of sentences express propositions: truth conditions on a (located, described) situation. Meanings are essentially indexical, with

717 views • 18 slides

More recommend