• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
4
0
0

Texte intégral

(1)

Christoph Benzm ¨uller Jens Otten (Eds.)

Automated Reasoning in

Quantified Non-Classical Logics

3rd International Workshop, ARQNL 2018, Oxford, United Kingdom, July 18th, 2018

Proceedings

CEUR Workshop Proceedings, Volume 2095

(2)

Automated Reasoning in Quantified Non-Classical Logics ARQNL 2018

Preface

This volume contains the proceedings of the Third International Workshop on Automated Rea- soning in Quantified Non-Classical Logics (ARQNL 2018), held July 18th, 2018, in Oxford, United Kingdom. The workshop was affiliated and co-located with the International Joint Conference on Automated Reasoning (IJCAR 2018), which was part of the Federated Logic Conference (FLoC 2018). The aim of the ARQNL 2018 Workshop has been to foster the de- velopment of proof calculi, automated theorem proving (ATP) systems and model finders for all sorts of quantified non-classical logics. The ARQNL workshop series provides a forum for researchers to present and discuss recent developments in this area.

Non-classical logics — such as modal logics, conditional logics, intuitionistic logic, de- scription logics, temporal logics, linear logic, multivalued logic, dynamic logic, deontic logic, fuzzy logic, paraconsistent logic, relevance logic, free logic, natural logic — have many appli- cations in AI, Computer Science, Philosophy, Linguistics, and Mathematics. Hence, the au- tomation of proof search in these logics is a crucial task. For many propositional non-classical logics there exist proof calculi and ATP systems. But proof search is significantly more difficult than in classical logic. For first-order and higher-order non-classical logics the mechanization and automation of proof search is even more difficult. Furthermore, extending existing non- classical propositional calculi, proof techniques and implementations to quantified logics is often not straightforward. As a result, for most quantified non-classical logics there exist no or only few (efficient) ATP systems. It is in particular the aim of the ARQNL workshop se- ries to initiate and foster practical implementations and evaluations of such ATP systems for non-classical logics.

The ARQNL 2018 Workshop received eight paper submissions. Each paper was reviewed by at least three referees, and following an online discussion, six research papers were selected to be included in the proceedings. The ARQNL 2018 Workshop also included invited talks by Larry Moss and Giles Reger. Additionally, one research paper was selected for presentation at the workshop.

We would like to sincerely thank the invited speakers and all authors for their contributions.

We would also like to thank the members of the Program Committee of ARQNL 2018 for their professional work in the review process. Furthermore, we would like to thank the IJCAR Workshop Chair Alberto Griggio and the Organizing Committee of FLoC 2018. Finally, many thanks to all active participants of the ARQNL 2018 Workshop.

Luxembourg and Oslo, July 2018 Christoph Benzm¨uller

Jens Otten

ii

(3)

Automated Reasoning in Quantified Non-Classical Logics ARQNL 2018

Organization

Program Committee

Christoph Benzm¨uller University of Luxembourg & FU Berlin, Germany – co-chair Jos´e Luiz Fiadeiro Royal Holloway University of London

Marcelo Finger University of S˜ao Paulo, Brazil

Didier Galmiche Universit´e de Lorraine - LORIA, France Rajeev Gor´e The Australian National University, Australia

Andreas Herzig IRIT-CNRS, France

Sven Linker University of Liverpool, UK

Aniello Murano Universit`a di Napoli “Federico II”, Italy Hans De Nivelle Nazarbayev University, Kazakhstan Jens Otten University of Oslo, Norway – co-chair Valeria De Paiva Nuance Communications, UK

Xavier Parent University of Luxembourg, Luxembourg Revantha Ramanayake Vienna University of Technology, Austria Giselle Reis Carnegie Mellon University, Qatar

Leila Ribeiro Universidade Federal do Rio Grande do Sul, Brazil Bruno Woltzenlogel Paleo Vienna University of Technology, Austria

Workshop Chairs

Christoph Benzm¨uller

University of Luxembourg (and Freie Universit¨at Berlin) Avenue de l’Universit´e, L-4365 Esch-sur-Alzette, Luxembourg E-mail:[email protected]

Jens Otten

University of Oslo

PO Box 1080 Blindern, 0316 Oslo, Norway E-mail:[email protected]

iii

(4)

Automated Reasoning in Quantified Non-Classical Logics ARQNL 2018

Contents

Implementations of Natural Logics 1–10

Lawrence S. Moss

Some Thoughts About FOL-Translations in Vampire 11–25

Giles Reger

Pseudo-Propositional Logic 26–33

Ahmad-Saher Azizi-Sultan

A Simple Semi-automated Proof Assistant for First-order Modal Logics 34–48 Tomer Libal

Labelled Connection-based Proof Search for Multiplicative Intuitionistic 49–63 Linear Logic

Didier Galmiche and Daniel M´ery

Labelled Calculi for Quantified Modal Logics with Non-rigid and Non- 64–78 denoting Terms

Eugenio Orlandelli and Giovanna Corsi

System Demonstration: The Higher-Order Prover Leo-III 79–85 Alexander Steen and Christoph Benzm¨uller

Evidence Extraction from Parameterised Boolean Equation Systems 86–100 Wieger Wesselink and Tim A.C. Willemse

iv

Références

Documents relatifs

This embedding enables the ap- plication of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and about conditional logics..

paraconsistent logic, applied to the analysis of the results of research conducted with students in teachers’ evaluation.. It is expected, in this research, that the results obtained

Et, depuis, de nombreuses am´eliorations et nouveaux d´eveloppements sont apparus dans la litt´erature (voir la page https://sites.google.com/site/malliavinstein pour un

The paper is organised as follows: in Section 2 we present the syntax and the semantics in terms of dynamic posets and also study the validity of some of the classical axioms in

We present a labelled sequent system and a nested sequent system for intuitionistic modal logics equipped with two relation symbols, one for the accessibility relation associated

We unify classical and intuitionistic propositional logics into a new logic we call Polarized Control Logic (PCL).. The polarity of a formula determines the availability of

If an instance of the 3 -rule is met, this 3 -rule instance is permuted down under the structural rules, using Lemma 7 and Lemma 8 of that paper, resulting in a derivation of

There is an important proof theoretic difference between a given classical logic and its in- tuitionistic restriction (see defn. 8): the classical formulas can be encoded using