72 research outputs found
Clausal Resolution for Modal Logics of Confluence
We present a clausal resolution-based method for normal multimodal logics of
confluence, whose Kripke semantics are based on frames characterised by
appropriate instances of the Church-Rosser property. Here we restrict attention
to eight families of such logics. We show how the inference rules related to
the normal logics of confluence can be systematically obtained from the
parametrised axioms that characterise such systems. We discuss soundness,
completeness, and termination of the method. In particular, completeness can be
modularly proved by showing that the conclusions of each newly added inference
rule ensures that the corresponding conditions on frames hold. Some examples
are given in order to illustrate the use of the method.Comment: 15 pages, 1 figure. Preprint of the paper accepted to IJCAR 201
Mechanised Uniform Interpolation for Modal Logics K, GL, and iSL
The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal logics, namely: (1) the modal logic K, for which a pen-and-paper proof exists; (2) Gödel-Löb logic GL, for which our formalisation clarifies an important point in an existing, but incomplete, sequent-style proof; and (3) intuitionistic strong Löb logic iSL, for which this is the first proof-theoretic construction of uniform interpolants. Our work also yields verified programs that allow one to compute the propositional quantifiers on any formula in this logic
Mechanised Uniform Interpolation for Modal Logics K, GL, and iSL
The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal logics, namely: (1) the modal logic K, for which a pen-and-paper proof exists; (2) Gödel-Löb logic GL, for which our formalisation clarifies an important point in an existing, but incomplete, sequent-style proof; and (3) intuitionistic strong Löb logic iSL, for which this is the first proof-theoretic construction of uniform interpolants. Our work also yields verified programs that allow one to compute the propositional quantifiers on any formula in this logic
Resolution-based decision procedures for subclasses of first-order logic
This thesis studies decidable fragments of first-order logic which are relevant to the field of nonclassical logic and knowledge representation. We show that refinements of resolution based on suitable liftable orderings provide decision procedures for the subclasses E+, K, and DK of first-order logic. By the use of semantics-based translation methods we can embed the description logic ALB and extensions of the basic modal logic K into fragments of first-order logic. We
describe various decision procedures based on ordering refinements and selection functions for these fragments and show that a polynomial simulation of tableaux-based decision procedures for these logics is possible. In the final part of the thesis we develop a benchmark suite and perform an empirical analysis of various modal theorem provers.Diese Arbeit untersucht entscheidbare Fragmente der Logik erster Stufe, die mit nicht-klassischen Logiken und Wissensrepräsentationsformalismen im Zusammenhang stehen. Wir zeigen, daß Entscheidungsverfahren für die Teilklassen E+, K, und DK der Logik erster Stufe unter Verwendung von Resolution eingeschränkt durch geeignete liftbare Ordnungen realisiert werden können. Durch Anwendung von semantikbasierten Übersetzungsverfahren lassen sich die Beschreibungslogik ALB und Erweiterungen der Basismodallogik K in Teilklassen der Logik erster Stufe einbetten. Wir stellen eine Reihe von Entscheidungsverfahren auf der Basis von Resolution eingeschränkt durch liftbare Ordnungen und Selektionsfunktionen für diese Logiken vor und zeigen, daß eine polynomielle Simulation von tableaux-basierten Entscheidungsverfahren für diese Logiken möglich ist. Im abschließenden Teil der Arbeit führen wir eine empirische Untersuchung der Performanz verschiedener modallogischer Theorembeweiser durch
The Temporal Logic of two dimensional Minkowski spacetime is decidable
We consider Minkowski spacetime, the set of all point-events of spacetime
under the relation of causal accessibility. That is, can access if an electromagnetic or (slower than light) mechanical signal could be
sent from to . We use Prior's tense language of
and representing causal accessibility and its converse relation. We
consider two versions, one where the accessibility relation is reflexive and
one where it is irreflexive.
In either case it has been an open problem, for decades, whether the logic is
decidable or axiomatisable. We make a small step forward by proving, for the
case where the accessibility relation is irreflexive, that the set of valid
formulas over two-dimensional Minkowski spacetime is decidable, decidability
for the reflexive case follows from this. The complexity of either problem is
PSPACE-complete.
A consequence is that the temporal logic of intervals with real endpoints
under either the containment relation or the strict containment relation is
PSPACE-complete, the same is true if the interval accessibility relation is
"each endpoint is not earlier", or its irreflexive restriction.
We provide a temporal formula that distinguishes between three-dimensional
and two-dimensional Minkowski spacetime and another temporal formula that
distinguishes the two-dimensional case where the underlying field is the real
numbers from the case where instead we use the rational numbers.Comment: 30 page
Automated Reasoning
This volume, LNAI 13385, constitutes the refereed proceedings of the 11th International Joint Conference on Automated Reasoning, IJCAR 2022, held in Haifa, Israel, in August 2022. The 32 full research papers and 9 short papers presented together with two invited talks were carefully reviewed and selected from 85 submissions. The papers focus on the following topics: Satisfiability, SMT Solving,Arithmetic; Calculi and Orderings; Knowledge Representation and Jutsification; Choices, Invariance, Substitutions and Formalization; Modal Logics; Proofs System and Proofs Search; Evolution, Termination and Decision Prolems. This is an open access book
Labeled natural deduction for temporal logics
Nonostante la notevole rilevanza delle logiche temporali in molti campi dell'informatica, la loro analisi teorica non è certo da ritenersi conclusa. In particolare, molti sono i punti ancora aperti nell'ambito della teoria della dimostrazione, specialmente se consideriamo le logiche temporali di tipo branching.
Il principale contributo di questa tesi consiste nella presentazione di un approccio modulare per la definizione di sistemi di deduzione naturale etichettata per un'ampia gamma di logiche temporali. Viene innanzitutto proposto un sistema per la logica temporale minimale di Prior; si mostra quindi come estenderlo in maniera modulare allo scopo di trattare logiche più complesse, quali ad esempio LTL. Viene infine proposta un'estensione al caso delle logiche branching, concentrando l'attenzione sulle logiche con semantica di tipo Ockhamist e bundled.
Per i sistemi proposti, viene condotta una dettagliata analisi dal punto di vista della teoria della dimostrazione. In particolare, nel caso delle logiche del tempo discreto, per le quali si richiedono regole che modellino un principio di induzione, viene definita una procedura di normalizzazione ispirata da quelle dei sistemi per l'Aritmetica di Heyting. Come conseguenza, si ottiene una dimostrazione puramente sintattica della consistenza dei sistemi.Despite the great relevance of temporal logics in many applications of computer science, their theoretical analysis is far from being concluded. In particular, we still lack a satisfactory proof theory for temporal logics and this is especially true in the case of branching-time logics.
The main contribution of this thesis consists in presenting a modular approach to the definition of labeled (natural) deduction systems for a large class of temporal logics. We start by proposing a system for the basic Priorean tense logic and show how to modularly enrich it in order to deal with more complex logics, like LTL. We also consider the extension to the branching case, focusing on the Ockhamist branching-time logics with a bundled semantics.
A detailed proof-theoretical analysis of the systems is performed. In particular, in the case of discrete-time logics, for which rules modeling an induction principle are required, we define a procedure of normalization inspired to those of systems for Heyting Arithmetic. As a consequence of normalization, we obtain a purely syntactical proof of the consistency of the systems
Achieving while maintaining:A logic of knowing how with intermediate constraints
In this paper, we propose a ternary knowing how operator to express that the
agent knows how to achieve given while maintaining
in-between. It generalizes the logic of goal-directed knowing how proposed by
Yanjing Wang 2015 'A logic of knowing how'. We give a sound and complete
axiomatization of this logic.Comment: appear in Proceedings of ICLA 201
- …