Journal•ISSN: 0039-3215
Studia Logica
Springer Science+Business Media
About: Studia Logica is an academic journal published by Springer Science+Business Media. The journal publishes majorly in the area(s): Modal logic & Intermediate logic. It has an ISSN identifier of 0039-3215. Over the lifetime, 2421 publications have been published receiving 39651 citations.
Topics: Modal logic, Intermediate logic, Normal modal logic, Many-valued logic, Intuitionistic logic
Papers published on a yearly basis
Papers
More filters
Journal Article•
TL;DR: The Open Society and Its Enemies as mentioned in this paper is regarded as one of Popper's most enduring books and contains insights and arguments that demand to be read to this day, as well as many of the ideas in the book.
Abstract: Described by the philosopher A.J. Ayer as a work of 'great originality and power', this book revolutionized contemporary thinking on science and knowledge. Ideas such as the now legendary doctrine of 'falsificationism' electrified the scientific community, influencing even working scientists, as well as post-war philosophy. This astonishing work ranks alongside The Open Society and Its Enemies as one of Popper's most enduring books and contains insights and arguments that demand to be read to this day.
3,178 citations
TL;DR: This book will not become a unity of the way for you to get amazing benefits at all, but, it will serve something that will let you get the best time and moment to spend for reading the book.
Abstract: It sounds good when knowing the the stag hunt and the evolution of social structure in this website. This is one of the books that many people looking for. In the past, many people ask about this book as their favourite book to read and collect. And now, we present hat you need quickly. It seems to be so happy to offer you this famous book. It will not become a unity of the way for you to get amazing benefits at all. But, it will serve something that will let you get the best time and moment to spend for reading the book.
585 citations
TL;DR: This article focuses on three features that play an important rôle in description logics (number restrictions, terminological axioms, and role constructors), and shows how they can be taken into account by tableau algorithms.
Abstract: Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description logics have turned out to be closely related to propositional modal logics and logics of programs (such as propositional dynamic logic), for which tableau procedures have been quite successful. Nevertheless, due to different underlying institutions and applications, most description logics differ significantly from run-of-the-mill modal and program logics. Consequently, the research on tableau algorithms in description logics led to new techniques and results, which are, however, also of interest for modal logicians. In this article, we will focus on three features that play an important role in description logics (number restrictions, terminological axioms, and role constructors), and show how they can be taken into account by tableau algorithms.
457 citations
TL;DR: The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems.
Abstract: Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as “Alternating-time Temporal Logic” (ATL). The key insight in ATL is that the path quantifiers of CTL could be replaced by “cooperation modalities”, of the form 《Γ》, where Γ is a set of agents. The intended interpretation of an ATL formula 《Γ》ϕ is that the agents Γ can cooperate to ensure that ϕ holds (equivalently, that Γ have a winning strategy for ϕ). In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as “group Γ can cooperate to bring about ϕ iff it is common knowledge in Γ that ψ”. The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems.
315 citations
TL;DR: This paper re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic.
Abstract: In the current paper, we re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able to express the (complete) extensions of an argumentation framework as models of a set of modal logic formulas that represents the argumentation framework. Using this approach, it becomes possible to define the grounded extension in terms of modal logic entailment.
303 citations