DOCSLIB.ORG

Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring Pei Huang1;3 , Minghao Liu1;3 , Ping Wang1;3 , Wenhui Zhang1;3 , Feifei Ma1;2;3∗ , Jian Zhang1;3∗ 1State Key Laboratory of Computer Science, ISCAS, China 2Laboratory of Parallel Software and Computational Science, ISCAS, China 3University of Chinese Academy of Sciences fhuangpei, liumh, wangping, zwh, maff, [email protected] Abstract 2010; Gasquet et al., 2005], first-order logic based methods [Ohlbach, 1991], resolution methods [Auffray et al., 1990; Modal logic S5 has found various applications in Nalon et al., 2017] and SAT-based methods [Kaminski and artificial intelligence. With the advances in modern Tebbi, 2013; Lagniez et al., 2018]. Due to the improve- SAT solvers, SAT-based approach has shown great ment of modern SAT solvers, SAT-based methods are show- potential in solving the satisfiability problem of S5. ing their potential and strength such as the-state-of-the-art S5 The scale of the SAT encoding for S5 is strongly solver named S52SAT [Caridroit et al., 2017]. The SAT-based influenced by the upper bound on the number of method has three advantages: 1) It can easily return a model possible worlds. In this paper, we present a novel (compared with resolution methods). 2) It can learn from the SAT-based approach for S5 satisfiability problem. conflicts (CDCL) and utilize them. 3) It makes a good bal- We show a normal form for S5 formulas. Based ance between guess and reasoning. on this normal form, a conflict graph can be de- S5-SAT can be reduced to SAT based on the theoretical rived whose chromatic number provides an upper proof showed in [Ladner, 1977; Fagin et al., 2004]. How- bound of the possible worlds and a lot of unneces- ever, naive SAT translation method will produce numerous sary search spaces can be eliminated in this process. variables and clauses. For some relatively large S5 formulas, A heuristic graph coloring algorithm is adopted to it will cause hundreds of thousands of variables and millions balance the efficiency and optimality. The number of clauses. Existing SAT-based methods frequently run out of of possible worlds can be significantly reduced for memory for these intractable scale formulas. Besides, a large many practical instances. Extensive experiments number of variables and clauses will wear away the efficiency demonstrate that our approach outperforms state- and the advantages of the SAT core. of-the-art S5-SAT solvers. In this paper, we propose a novel SAT-based method for S5-SAT which can save a lot of memory and significantly im- 1 Introduction prove the computation efficiency. We first show a CNF-like normal form and name it S5-NF. Based on this normal form, Modal logic provides a theoretical framework for impor- a diamond conflict graph can be derived whose chromatic tant applications in many areas of artificial intelligence, in- number provides an upper bound on the number of necessary cluding game theory [Lorini and Schwarzentruber, 2010], worlds. In practice, the chromatic number is obtained ap- knowledge compilation [Bienvenu et al., 2010], contingent proximately with a heuristic graph coloring algorithm, so that planning [Niveau and Zanuttini, 2016] and formal verifi- the extra cost is quite limited. Moreover, a lot of unnecessary cation [Aguilera and Fernandez-Duque,´ 2016; Fairtlough search spaces can be eliminated in this process. Experimental and Mendler, 1994]. In the past decades, automated rea- results show that our solver outperforms the state-of-the-art soning techniques for modal logic has been vastly studied S5 solvers, on some instances even by orders of magnitudes (e.g. [Balco et al., 2018; Giunchiglia and Sebastiani, 1996; in efficiency. Besides, our solver consumes much less mem- Kaminski and Tebbi, 2013]). ory on many large scale S5 formulas. S5 is a well-known modal logic system, which is suit- This paper is organized as follows: first, we introduce some able for representing and reasoning about the knowledge of preliminaries about modal logic S5; then we detail the S5-NF; a single agent [Fagin et al., 2004]. Recently, modal logic after that, the diamond conflict checking (DCC) strategy and S5 is used in knowledge compilation [Bienvenu et al., 2010; the framework of solving S5-SAT will be expounded; further- Niveau and Zanuttini, 2016] and epistemic planner [Wan et more, we evaluate and discuss the experimental results; in the al., 2015]. So, it promotes us to develop and improve auto- final section, conclusions are drawn. mated reasoning technique for modal logic S5. There are four common ways to tackle the modal logic 2 Preliminaries satisfiability problems: tableau methods [Gotzmann¨ et al., This section briefly reviews the syntax and the semantics of ∗Corresponding Authors modal logic S5. The set of formulas φ of S5 is a language 1093 Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) L which extends the propositional language with the modal 3 A Normal Form for S5 connectives (or modal operators) and }. (box) means A normal form for S5 formulas, called S5-NF, is defined in necessity and } (diamond) means possibility. For example, this section. It is a kind of CNF-like normal form. Actu- p expresses the concept that “It is necessary that p” and ally, many CNF-like normal forms were defined in previous }p expresses the concept that “It is possible that p”. The works for resolution such as [del Cerro, 1982; Enjalbert and language is defined by the grammar: del Cerro, 1989; Salhi and Sioutis, 2015]. The S5-NF is sim- φ ::= ? j > j p j :φ j φ ^ φ j φ _ φ j φ j }φ ilar to these CNF-like normal forms but with some textural difference. It is designed for our solving framework, and we where p 2 P and P denotes a countably infinite non-empty will show how to transform an S5 formula into an S5-NF. set of propositional variables. Logical connectives ‘!’ and ‘$’ are omitted here. 3.1 Reduction Rules Now-standard Kripke semantics for modal logic defines a First, some key rules in the transformation process are listed frame, which consists of a non-empty set W , and a binary as follows. Note that 2 f; }g. relation R. The members of W are generally called possible n worlds. The relation R, also known as the accessibility rela- 1) φ ) φ tion, is defined between the possible worlds in W . For exam- 2) n}φ )}φ ple, w R w0 means the world w0 is accessible from world w. 3) (φ ^ φ ^ ::: ^ φ ) ) φ ^ φ ^ ::: ^ φ I is a function W × P ! f0; 1g. 1 2 n 1 2 n S5 has the following axioms: 4) }(φ1 _ φ2 _ ::: _ φn) )}φ1 _}φ2 _ ::: _}φn K. (A ! B) ! (A ! B) 5) ('1 _ '2 _ ::: _ 'm _ φ1 _ φ2 _ ::: _ φn) ) (' _ ' _ ::: _ ' ) _ φ _ φ _ ::: _ φ T . A ! A 1 2 m 1 2 n 6) }('1 ^ '2 ^ ::: ^ 'm ^ φ1 ^ φ2 ^ ::: ^ φn) B. A ! }A )}('1 ^ '2 ^ ::: ^ 'm) ^ φ1 ^ φ2 ^ ::: ^ φn 4. A ! A The correctness of these rules is easy to verify. We present These axioms imply that the relation R in S5 is reflexive, the sketch of the proof of these rules. symmetric and transitive. So the possible-worlds semantics Lemma 1. }p $ p, p $ p, }p $ }p, }}p $ for S5 can be simplified as a simple version without accessi- }p. bility relation [Fitting, 1999]. The satisfiability relation for formulas in L is recursively defined as follows: Lemma 1 can be easily proved according to the reflexivity, symmetry and transitivity of S5. (W; I; w) > Applying these rules recursively we can conclude that 1) (W; I; w) p iff I(w; p) = 1 and 2) hold. These two rules can simplify multiple modal operators to one, such as }}φ $ φ. That means 2 (W; I; w) :φ iff (W; I; w) φ each formula can only keep the nearest modal operator. (W; I; w) φ ^ ' iff (W; I; w) φ and (W; I; w) ' Rules 3) and 4) can be easily proved via iii) and iv) of the equivalences listed previously. (W; I; w) φ _ ' iff (W; I; w) φ or (W; I; w) ' Rules 5) and 6) can be seen as supplements of 3) and 4). In (W; I; w) φ iff 8w0 2 W; (W; I; w0) φ fact, we can not rewrite (p _ q) to the disjunction p _ q because (p _ q) = p _ q. But we can rewrite (p _}q) (W; I; w) }φ iff 9w0 2 W; (W; I; w0) φ to p _}q, as formulated in the following lemma. Following the semantics (satisfiability relation), we have a Lemma 2. (p _}q) $ p _}q, (p _ q) $ p _ q, list of equivalences as follows. }(p ^ q) $ }p ^ q, }(p ^ }q) $ }p ^ }q i) > $ >, ? $ ?, }> $ >, }? $ ? One can easily prove the lemma via axioms in S5. Apply- ii) :}φ $ :φ, :φ $ }:φ ing these rules recursively we can prove that 5) and 6) hold. iii) (φ ^ ') $ φ ^ ' 3.2 S5 Normal Form iv) }(φ _ ') $ }φ _}' S5-NF is similar to the CNF in propositional logic. So, we The diamond degree of a negation normal form φ, dd(φ), extend some concepts from propositional logic to name the is defined recursively as: components of S5-NF. Any S5 formula can be reduced to an equivalent one of modal degree 0 or 1 [Mints and Minc, dd(>) = dd(:>) = dd(p) = dd(:p) = 0 1992].
Load more

Recommended publications
  • Intuitionistic Modal Logic IS5 Formalizations, Interpretation, Analysis
    Uniwersytet Wroclawski Wydzia lMatematyki i Informatyki Instytut Informatyki Intuitionistic Modal Logic IS5 Formalizations, Interpretation, Analysis Agata Murawska A Master's Thesis written under the supervision of Ma lgorzataBiernacka Wroclaw, May 2013 1 2 Abstract IS5 is an intuitionistic variant of S5 modal logic, one of the normal modal logics, with accessibility relation defined as an equivalence. In this thesis we formalize two known variants of natural deduction systems for IS5 along with their corresponding languages. First, the syntactically pure IS5LF vari- ant that does not name the modal worlds, is due to Galmiche and Sahli. The second one, IS5L, using world names (labels) in inference rules and in terms of its language, is due to Tom Murphy et al. For each of the languages accompanying these logics we prove standard properties such as progress and preservation. We show the connection be- tween these languages via a series of type-preserving transformations of terms and contexts. Finally, we give a proof of termination for the call-by-name strategy of evaluation using logical relations method. The formalization of all of the above properties is done in Coq1 proof assistant. In particular, the proof of termination allows { via Curry-Howard isomorphism { to extract the evaluator in OCaml from the proof. Our contributions include providing a term language LIS5-LF for IS5LF, as well as creating an in-between logic IS5Hyb and the corresponding language LIS5-Hyb, used when showing the connection between LIS5-L and LIS5-LF. For the former language we formalize the termination of call-by-name evaluation strategy. 1The Coq development is available at author's github page, http://github.com/ Ayertienna/IS5.
    [Show full text]
  • On the Logics with Propositional Quantifiers Extending S5
    On the Logics with Propositional Quantifiers Extending S5Π Yifeng Ding (voidprove.com) Aug. 27, 2018 @ AiML 2018 UC Berkeley Group of Logic and the Methodology of Science • Kit Fine systematically studied a few modal logic systems with propositional quantifers based on S5. • We provide an analogue of Scroggs's theorem for modal logics with propositional quantifiers using algebraic semantics. • More generally, it is interesting to see how classical results generalize when using algebraic semantics. Introduction • We have expressions that quantifies over propositions: \Everything I believe is true." (Locally) 2 • We provide an analogue of Scroggs's theorem for modal logics with propositional quantifiers using algebraic semantics. • More generally, it is interesting to see how classical results generalize when using algebraic semantics. Introduction • We have expressions that quantifies over propositions: \Everything I believe is true." (Locally) • Kit Fine systematically studied a few modal logic systems with propositional quantifers based on S5. 2 • More generally, it is interesting to see how classical results generalize when using algebraic semantics. Introduction • We have expressions that quantifies over propositions: \Everything I believe is true." (Locally) • Kit Fine systematically studied a few modal logic systems with propositional quantifers based on S5. • We provide an analogue of Scroggs's theorem for modal logics with propositional quantifiers using algebraic semantics. 2 Introduction • We have expressions that quantifies over propositions: \Everything I believe is true." (Locally) • Kit Fine systematically studied a few modal logic systems with propositional quantifers based on S5. • We provide an analogue of Scroggs's theorem for modal logics with propositional quantifiers using algebraic semantics. • More generally, it is interesting to see how classical results generalize when using algebraic semantics.
    [Show full text]
  • Kripke Completeness Revisited
    Kripke completeness revisited Sara Negri Department of Philosophy, P.O. Box 9, 00014 University of Helsinki, Finland. e-mail: sara.negri@helsinki.fi Abstract The evolution of completeness proofs for modal logic with respect to the possible world semantics is studied starting from an analysis of Kripke’s original proofs from 1959 and 1963. The critical reviews by Bayart and Kaplan and the emergence of Henkin-style completeness proofs are detailed. It is shown how the use of a labelled sequent system permits a direct and uniform completeness proof for a wide variety of modal logics that is close to Kripke’s original arguments but without the drawbacks of Kripke’s or Henkin-style completeness proofs. Introduction The question about the ultimate attribution for what is commonly called Kripke semantics has been exhaustively discussed in the literature, recently in two surveys (Copeland 2002 and Goldblatt 2005) where the rˆoleof the precursors of Kripke semantics is documented in detail. All the anticipations of Kripke’s semantics have been given ample credit, to the extent that very often the neutral terminology of “relational semantics” is preferred. The following quote nicely summarizes one representative standpoint in the debate: As mathematics progresses, notions that were obscure and perplexing become clear and straightforward, sometimes even achieving the status of “obvious.” Then hindsight can make us all wise after the event. But we are separated from the past by our knowledge of the present, which may draw us into “seeing” more than was really there at the time. (Goldblatt 2005, section 4.2) We are not going to treat this issue here, nor discuss the parallel development of the related algebraic semantics for modal logic (Jonsson and Tarski 1951), but instead concentrate on one particular and crucial aspect in the history of possible worlds semantics, namely the evolution of completeness proofs for modal logic with respect to Kripke semantics.
    [Show full text]
  • A Note on Algebraic Semantics for S5 with Propositional Quantifiers
    A Note on Algebraic Semantics for S5 with Propositional Quantifiers Wesley H. Holliday University of California, Berkeley Preprint of April 2017. Forthcoming in Notre Dame Journal of Formal Logic. Abstract In two of the earliest papers on extending modal logic with propositional quanti- fiers, R. A. Bull and K. Fine studied a modal logic S5Π extending S5 with axioms and rules for propositional quantification. Surprisingly, there seems to have been no proof in the literature of the completeness of S5Π with respect to its most natural algebraic semantics, with propositional quantifiers interpreted by meets and joins over all ele- ments in a complete Boolean algebra. In this note, we give such a proof. This result raises the question: for which normal modal logics L can one axiomatize the quantified propositional modal logic determined by the complete modal algebras for L? Keywords: modal logic, propositional quantifiers, algebraic semantics, monadic algebras, MacNeille completion MSC: 03B45, 03C80, 03G05 1 Introduction The idea of extending the language of propositional modal logic with propositional quan- tifiers 8p and 9p was first investigated in Kripke 1959, Bull 1969, Fine 1970, and Kaplan 1970.1 The language LΠ of quantified propositional modal logic is given by the grammar ' ::= p j :' j (' ^ ') j ' j 8p'; where p comes from a countably infinite set Prop of propositional variables. The other connectives _, !, and $ are defined as usual, and we let ♦' := ::' and 9p' := :8p:'. A focus of the papers cited above was on extending the modal logic S5 with propositional quantification. As usual, one can think about natural extensions syntactically or seman- tically.
    [Show full text]
  • Reflecting on the Legacy of CI Lewis
    Organon F, Volume 26, 2019, Issue 3 Special Issue Reflecting on the Legacy of C.I. Lewis: Contemporary and Historical Perspectives on Modal Logic Matteo Pascucci and Adam Tamas Tuboly Guest Editors Contents Matteo Pascucci and Adam Tamas Tuboly: Preface ................................... 318 Research Articles Max Cresswell: Modal Logic before Kripke .................................................. 323 Lloyd Humberstone: Semantics without Toil? Brady and Rush Meet Halldén .................................................................................................. 340 Edwin Mares and Francesco Paoli: C. I. Lewis, E. J. Nelson, and the Modern Origins of Connexive Logic ............................................... 405 Claudio Pizzi: Alternative Axiomatizations of the Conditional System VC ............................................................................................ 427 Thomas Atkinson, Daniel Hill and Stephen McLeod: On a Supposed Puzzle Concerning Modality and Existence .......................................... 446 David B. Martens: Wiredu contra Lewis on the Right Modal Logic ............. 474 Genoveva Martí and José Martínez-Fernández: On ‘actually’ and ‘dthat’: Truth-conditional Differences in Possible Worlds Semantics ............... 491 Daniel Rönnedal: Semantic Tableau Versions of Some Normal Modal Systems with Propositional Quantifiers ................................................ 505 Report Martin Vacek: Modal Metaphysics: Issues on the (Im)possible VII ............. 537 Organon F 26 (3) 2019: 318–322
    [Show full text]
  • Structures for Epistemic Logic
    Structures for Epistemic Logic Nick Bezhanishvili and Wiebe van der Hoek Abstract In this paper we overview the main structures of epistemic and doxas- tic logic. We start by discussing the most celebrated models for epistemic logic, i.e., epistemic Kripke structures. These structures provide a very intuitive interpre- tation of the accessibility relation, based on the notion of information. This also naturally extends to the multi-agent case. Based on Kripke models, we then look at systems that add a temporal or a computational component, and those that pro- vide a ‘grounded’ semantics for knowledge. We also pay special attention to ‘non- standard semantics’ for knowledge and belief, i.e., semantics that are not based on an underlying relation on the sets of states. In particular, we discuss here neighbour- hood semantics and topological semantics. In all of these approaches, we can clearly point at streams of results that are inspired by work by Johan van Benthem. We are extremely pleased and honoured to be part of this book dedicated to his work and influences. Key words: Epistemic logic, doxastic logic, relational structures, neighbourhood models, topological semantics 1 Introduction Epistemic modal logic in a narrow sense studies and formalises reasoning about knowledge. In a wider sense, it gives a formal account of the informational attitude that agents may have, and covers notions like knowledge, belief, uncertainty, and hence incomplete or partial information. As is so often the case in modal logic, Nick Bezhanishvili Department of Philosophy, Utrecht University, e-mail: [email protected] Wiebe van der Hoek Department of Computer Science, University of Liverpool, e-mail: [email protected] 1 2 Nick Bezhanishvili and Wiebe van der Hoek such formalised notions become really interesting when studied in a broader con- text.
    [Show full text]
  • Cse371/Mat371 LOGIC
    cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 3 Chapter 7 Introduction to Intuitionistic and Modal Logics Slides Set 3 PART 5: Introduction to Modal Logics Algebraic Semantics for modal S4 and S5 Introduction to Modal Logics The non-classical logics can be divided in two groups: those that rival classical logic and those which extend it The Lukasiewicz, Kleene, and intuitionistic logics are in the first group The modal logics are in the second group The rival logics do not differ from classical logic in terms of the language employed The rival logics differ in that certain theorems or tautologies of classical logic are rendered false, or not provable in them Introduction to Modal Logics The most notorious example of the rival difference of logics based on the same language is the law of excluded middle (A [:A) This is provable in, and is a tautology of classical logic But is not provable in, and is not tautology of the intuitionistic logic It also is not a tautology under any of the extensional logics semantics we have discussed Introduction to Modal Logics Logics which extend classical logic sanction all the theorems of classical logic but, generally, supplement it in two ways Firstly, the languages of these non-classical logics are extensions of those of classical logic Secondly, the theorems of these non-classical logics supplement those of classical logic Introduction to Modal Logics Modal logics are enriched by the addition of two new
    [Show full text]
  • Normal Modal Logics
    Part I Normal Modal Logics 1 This part covers the metatheory of normal modal logics. It currently consists of Aldo Antonelli's notes on classical correspondence theory for basic modal logic. 2 normal-modal-logic rev: a36bf42 (2021-09-21) by OLP/ CC{BY Chapter 1 Syntax and Semantics 1.1 Introduction nml:syn:int: Modal logic deals with modal propositions and the entailment relations among sec them. Examples of modal propositions are the following: 1. It is necessary that 2 + 2 = 4. 2. It is necessarily possible that it will rain tomorrow. 3. If it is necessarily possible that ' then it is possible that '. Possibility and necessity are not the only modalities: other unary connectives are also classified as modalities, for instance, \it ought to be the case that '," \It will be the case that '," \Dana knows that '," or \Dana believes that '." Modal logic makes its first appearance in Aristotle's De Interpretatione: he was the first to notice that necessity implies possibility, but not vice versa; that possibility and necessity are inter-definable; that If ' ^ is possibly true then ' is possibly true and is possibly true, but not conversely; and that if ' ! is necessary, then if ' is necessary, so is . The first modern approach to modal logic was the work of C. I. Lewis, cul- minating with Lewis and Langford, Symbolic Logic (1932). Lewis & Langford were unhappy with the representation of implication by means of the mate- rial conditional: ' ! is a poor substitute for \' implies ." Instead, they proposed to characterize implication as \Necessarily, if ' then ," symbolized as ' J .
    [Show full text]
  • A Resolution Method for Modal Logic S5
    EPiC Series in Computer Science Volume 36, 2015, Pages 252{262 GCAI 2015. Global Conference on Artificial Intelligence A Resolution Method for Modal Logic S5 Yakoub Salhi and Michael Sioutis Universit´ed'Artois, CRIL, CNRS UMR 8188 Rue Jean Souvraz, SP-18 62307, Lens Cedex 3 fsalhi,[email protected] Abstract In this work, we aim to define a resolution method for the modal logic S5. We first propose a conjunctive normal form (S5-CNF) which is mainly based on using labels referring to semantic worlds. In a sense, S5-CNF can be seen as a generalization of the conjunctive normal form in propositional logic by including the modal connective of necessity and labels in the clause structure. We show that every S5 formula can be transformed into an S5-CNF formula using a linear encoding. Then, in order to show the suitability of our normal form, we describe a modeling of the graph coloring problem. Finally, we introduce a simple resolution method for S5, composed of three deductive rules, and we show that it is sound and complete. Our deductive rules can be seen as adaptations of Robinson's resolution rule to the possible-worlds semantics. 1 Introduction Robinson's resolution method forms the keystone of logic programming and several automated theorem-provers. It corresponds to a proof rule leading to a decision procedure for deciding whether a formula is unsatisfiable in propositional logic. In this work, we are interested in defining a resolution method for modal logic S5. The normal modal logic S5 is among the most studied modal logics.
    [Show full text]