scholarly journals Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring

2019 ◽  
Author(s):  
Pei Huang ◽  
Minghao Liu ◽  
Ping Wang ◽  
Wenhui Zhang ◽  
Feifei Ma ◽  
...  
Keyword(s):  
Normal Form ◽  
Modal Logic ◽  
Graph Coloring ◽  
Upper Bound ◽  
Possible Worlds ◽  
Satisfiability Problem ◽  
Conflict Graph ◽  
Sat Solvers ◽  
Search Spaces ◽  
Sat Encoding

Modal logic S5 has found various applications in artificial intelligence. With the advances in modern SAT solvers, SAT-based approach has shown great potential in solving the satisfiability problem of S5. The scale of the SAT encoding for S5 is strongly influenced by the upper bound on the number of possible worlds. In this paper, we present a novel SAT-based approach for S5 satisfiability problem. We show a normal form for S5 formulas. Based on this normal form, a conflict graph can be derived whose chromatic number provides an upper bound of the possible worlds and a lot of unnecessary search spaces can be eliminated in this process. A heuristic graph coloring algorithm is adopted to balance the efficiency and optimality. The number of possible worlds can be significantly reduced for many practical instances. Extensive experiments demonstrate that our approach outperforms state-of-the-art S5-SAT solvers.

scholarly journals A Resolution Method for Modal Logic S5

10.29007/1zgr ◽  
2018 ◽  
Author(s):  
Yakoub Salhi ◽  
Michael Sioutis
Keyword(s):  
Normal Form ◽  
Modal Logic ◽  
Graph Coloring ◽  
Propositional Logic ◽  
Possible Worlds ◽  
Conjunctive Normal Form ◽  
Clause Structure ◽  
Possible Worlds Semantics ◽  
Resolution Method ◽  
Resolution Rule

The aim of this work is to define a resolution method for the modal logic S5. Wefirst propose a conjunctive normal form (S5-CNF) which is mainly based on using labelsreferring to semantic worlds. In a sense, S5-CNF can be seen as a generalization of theconjunctive normal form in propositional logic by using in the clause structure the modalconnective of necessity and labels. We show that every S5 formula can be transformedinto an S5-CNF formula using a linear encoding. Then, in order to show the suitabilityof our normal form, we describe a modeling of the problem of graph coloring. Finally, weintroduce a simple resolution method for S5, composed of three deductive rules, and weshow that it is sound and complete. Our deductive rules can be seen as adaptations ofRobinson’s resolution rule to the possible-worlds semantics.

Is There Life in Possible Worlds?

2017 ◽  
Author(s):  
Mark Wilson
Keyword(s):  
Possible Worlds ◽  
Machine Design ◽  
Lagrangian Mechanics ◽  
Philosophical Investigations ◽  
Search Spaces ◽  
Dimensional Modeling ◽  
Lower Dimensional

Scientists have developed various collections of specialized possibilities to serve as search spaces in which excessive reliance upon speculative forms of lower dimensional modeling or other unwanted details can be skirted. Two primary examples are discussed: the search spaces of machine design and the virtual variations utilized within Lagrangian mechanics. Contemporary appeals to “possible worlds” attempt to imbed these localized possibilities within fully enunciated universes. But not all possibilities are made alike and these reductive schemes should be resisted, on the grounds that they render the utilities of everyday counterfactuals and “possibility” talk incomprehensible. The essay also discusses whether Wittgenstein’s altered views in his Philosophical Investigations reflect similar concerns.

Post completeness in modal logic

1972 ◽  
Vol 37 (4) ◽  
pp. 711-715 ◽  
Author(s):  
Krister Segerberg
Keyword(s):  
Modal Logic ◽  
Upper Bound ◽  
Modus Ponens ◽  
Proper Subset ◽  
Proper Extension ◽  
Image Position

Let ⊥, →, and □ be primitive, and let us have a countable supply of propositional letters. By a (modal) logic we understand a proper subset of the set of all formulas containing every tautology and being closed under modus ponens and substitution. A logic is regular if it contains every instance of □A ∧ □B ↔ □(A ∧ B) and is closed under the ruleA regular logic is normal if it contains □⊤. The smallest regular logic we denote by C (the same as Lemmon's C2), the smallest normal one by K. If L and L' are logics and L ⊆ L′, then L is a sublogic of L', and L' is an extension of L; properly so if L ≠ L'. A logic is quasi-regular (respectively, quasi-normal) if it is an extension of C (respectively, K).A logic is Post complete if it has no proper extension. The Post number, denoted by p(L), is the number of Post complete extensions of L. Thanks to Lindenbaum, we know thatThere is an obvious upper bound, too:Furthermore,.

On the Modal μ-Calculus Over Finite Symmetric Graphs

2015 ◽  
Vol 65 (4) ◽  
Author(s):  
Giovanna D’Agostino ◽  
Giacomo Lenzi
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Satisfiability Problem ◽  
Finite Model ◽  
Model Property ◽  
Finite Model Property ◽  
Symmetric Graphs ◽  
Trivial Consequence

AbstractIn this paper we consider the alternation hierarchy of the modal μ-calculus over finite symmetric graphs and show that in this class the hierarchy is infinite. The μ-calculus over the symmetric class does not enjoy the finite model property, hence this result is not a trivial consequence of the strictness of the hierarchy over symmetric graphs. We also find a lower bound and an upper bound for the satisfiability problem of the μ-calculus over finite symmetric graphs.

scholarly journals A Theory of Satisfiability-Preserving Proofs in SAT Solving

10.29007/tc7q ◽  
2018 ◽  
Author(s):  
Adrián Rebola-Pardo ◽  
Martin Suda
Keyword(s):  
Propositional Logic ◽  
Logical Truth ◽  
Point Of View ◽  
Traditional View ◽  
Satisfiability Problem ◽  
Sat Solving ◽  
Sat Solvers ◽  
Proof Systems ◽  
Meta Level

We study the semantics of propositional interference-based proof systems such as DRAT and DPR. These are characterized by modifying a CNF formula in ways that preserve satisfiability but not necessarily logical truth. We propose an extension of propositional logic called overwrite logic with a new construct which captures the meta-level reasoning behind interferences. We analyze this new logic from the point of view of expressivity and complexity, showing that while greater expressivity is achieved, the satisfiability problem for overwrite logic is essentially as hard as SAT, and can be reduced in a way that is well-behaved for modern SAT solvers. We also show that DRAT and DPR proofs can be seen as overwrite logic proofs which preserve logical truth. This much stronger invariant than the mere satisfiability preservation maintained by the traditional view gives us better understanding on these practically important proof systems. Finally, we showcase this better understanding by finding intrinsic limitations in interference-based proof systems.

The Evil That Free Will Does: Plantinga’s Dubious Defense

Metaphysica ◽  
2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Mark Maller
Keyword(s):  
Modal Logic ◽  
Free Will ◽  
Possible Worlds ◽  
Problem Of Evil ◽  
Freedom Of Will ◽  
The Problem Of Evil ◽  
Possible Worlds Theory ◽  
Free Will Defense

Abstract Alvin Plantinga’s controversial free will defense (FWD) for the problem of evil is an important attempt to show with certainty that moral evils are compatible and justifiable with God’s omnipotence and omniscience. I agree with critics who argue that it is untenable and the FWD fails. This paper proposes new criticisms by analyzing Plantinga’s presuppositions and objectionable assumptions in God, Freedom and Evil. Notably, his limited concept of omnipotence, and possible worlds theory lack rigorous argument and are subjectively biased with irrelevant weak examples. My ontological possible worlds theory (Possible Conditional Timelines) shows that it is very likely that the omnipotent God exists of necessity in some worlds but perhaps not this one. Omnipotence is total and absolute, and should imply the freedom of will to actualize all worlds God chooses. Plantinga’s position regarding God’s omniscience of future counterfactuals is implausible based on modal logic conjecture.

Language, Meaning, and Information

2014 ◽  
Author(s):  
Scott Soames
Keyword(s):  
Modal Logic ◽  
Philosophy Of Language ◽  
Possible Worlds ◽  
Philosophy Of Mathematics ◽  
Scientific Study ◽  
Bertrand Russell ◽  
Gottlob Frege ◽  
Possible Worlds Semantics ◽  
Language Meaning

This chapter is a case study of the process by which the attempt to solve philosophical problems sometimes leads to the birth of new domains of scientific inquiry. It traces how advances in logic and the philosophy of mathematics, starting with Gottlob Frege and Bertrand Russell, provided the foundations for what became a rigorous and scientific study of language, meaning, and information. After sketching the early stages of the story, it explains the importance of modal logic and “possible worlds semantics” in providing the foundation for the last half century of work in linguistic semantics and the philosophy of language. It argues that this foundation is insufficient to support the most urgently needed further advances. It proposes a new conception of truth-evaluable information as inherently representational cognitive acts of certain kinds. The chapter concludes by explaining how this conception of propositions can be used to illuminate the notion of truth; vindicate the connection between truth and meaning; and fulfill a central, but so far unkept, promise of possible worlds semantics.

Logical Tools

2021 ◽  
pp. 14-52
Author(s):  
Cian Dorr ◽  
John Hawthorne ◽  
Juhani Yli-Vakkuri
Keyword(s):  
Modal Logic ◽  
Possible Worlds ◽  
Higher Order ◽  
Order Logic ◽  
First Order Logic ◽  
First Order ◽  
System P

This chapter presents the system of classical higher-order modal logic which will be employed throughout this book. Nothing more than a passing familiarity with classical first-order logic and standard systems of modal logic is presupposed. We offer some general remarks about the kind of commitment involved in endorsing this logic, and motivate some of its more non-standard features. We also discuss how talk about possible worlds can be represented within the system.

Chapter 13. Symmetry and Satisfiability

2021 ◽  
Author(s):  
Karem A. Sakallah
Keyword(s):  
Group Theory ◽  
Normal Form ◽  
Boolean Functions ◽  
Search Algorithm ◽  
Conjunctive Normal Form ◽  
Search Space ◽  
Decision Problems ◽  
Mathematical Language ◽  
Sat Solvers ◽  
Speed Up

Symmetry is at once a familiar concept (we recognize it when we see it!) and a profoundly deep mathematical subject. At its most basic, a symmetry is some transformation of an object that leaves the object (or some aspect of the object) unchanged. For example, a square can be transformed in eight different ways that leave it looking exactly the same: the identity “do-nothing” transformation, 3 rotations, and 4 mirror images (or reflections). In the context of decision problems, the presence of symmetries in a problem’s search space can frustrate the hunt for a solution by forcing a search algorithm to fruitlessly explore symmetric subspaces that do not contain solutions. Recognizing that such symmetries exist, we can direct a search algorithm to look for solutions only in non-symmetric parts of the search space. In many cases, this can lead to significant pruning of the search space and yield solutions to problems which are otherwise intractable. This chapter explores the symmetries of Boolean functions, particularly the symmetries of their conjunctive normal form (CNF) representations. Specifically, it examines what those symmetries are, how to model them using the mathematical language of group theory, how to derive them from a CNF formula, and how to utilize them to speed up CNF SAT solvers.

Sign in / Sign up

Export Citation Format

Share Document