**Automated Reasoning in Quantified Non-Classical Logics**

**IJCAR-Workshop, July 23, 2014, Vienna, Austria**

## Overview

Non-classical logics – such as modal logics, conditional logics, intuitionistic logic, description logics, temporal logics, linear logic, dynamic logic, fuzzy logic, paraconsistent logic, relevance logic – have many applications in AI, Computer Science, Philosophy, Linguistics, and Mathematics. Hence, the automation of proof search in these logics is a crucial task.

For many propositional non-classical logics there exist proof calculi and automated theorem proving (ATP) systems. But proof search is significant 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.

## Aims and Scope

The ARQNL workshop aims at fostering the development of proof calculi, ATP systems and model finders for all sorts of quantified non-classical logics. The workshop will provide a forum for researchers to present and discuss recent developments in this area. These contributions may range from theory to system descriptions and implementations. Contributions may also outline relevant applications, describe problem formalizations, example problems, and benchmarks. We welcome contributions from computer scientists, linguists, philosophers, and mathematicians. A particular emphasis of the first edition of the ARQNL workshop will be on quantified modal logics.

Topics of the ARQNL workshop will cover all aspects related to the mechanization and automation of quantified non-classical logics, including but not limited to

- Proof theory, semantics, meta theory, and cut-elimination
- Proof search calculi, including sequent calculi, tableau calculi, connection calculi, resolution calculi, and instance-based calculi
- Modal logic, conditional logic, intuitionistic logic, description logic, temporal logic, linear logic, dynamic logic, fuzzy logic, paraconsistent logic, and relevance logic
- Techniques, strategies and heuristics to deal with first-order or higher-order quantification
- Implementation of theorem provers and experimental evaluations
- Problem libraries and benchmarking for theorem provers
- Applications, formalizations, and example problems
- User interfaces, proof representation, and syntax issues

## Call for Papers

## Important Dates (Extended)

- Submission deadline: May 26, 2014
- Notification of acceptance: June 23, 2014
- Final version of papers due: July 7, 2014
- Workshop: July 23, 2014

## Organizers

- Christoph Benzmüller (Freie Universität Berlin) - chair

c.benzmueller@fu-berlin.de - Jens Otten (University of Potsdam) - chair

jeotten@cs.uni-potsdam.de

## Program Committee