1.8k citations
- Centre National de la Recherche ScientifiqueFR184 papers
- University of ViennaAT137 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR119 papers
- European Organization for Nuclear ResearchCH107 papers
- Charles UniversityCZ106 papers
- CEA Paris-SaclayFR102 papers
- Université Paris-SaclayFR102 papers
- University of BolognaIT90 papers
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ89 papers
- Institute of High Energy PhysicsCN88 papers
- Sapienza University of RomeIT85 papers
- Centro de Investigaciones Energéticas, Medioambientales y TecnológicasES83 papers
8 papers · 2 filters
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems
Tim Lyon
This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecti…
A Note on Reasoning on with Defeasibility
Loris Bozzato, Thomas Eiter, Luciano Serafini
Representation of defeasible information is of interest in description logics, as it is related to the need of accommodating exceptional instances in knowledge bases. In this direc…
Sequent-Type Proof Systems for Three-Valued Default Logic
Sopo Pkhakadze
Sequent-type proof systems constitute an important and widely-used class of calculi well-suited for analysing proof search. In my master's thesis, I introduce sequent-type calculi…
QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties
Florian Lonsing, Uwe Egly
We present version 2.0 of QRATPre+, a preprocessor for quantified Boolean formulas (QBFs) based on the QRAT proof system and its generalization QRAT+. These systems rely on strong…
Natural Deduction and Normalization Proofs for the Intersection Type Discipline
Federico Aschieri
Refining and extending previous work by Retoré, we develop a systematic approach to intersection types via natural deduction. We show how a step of beta reduction can be seen as pe…
Cut-free Calculi and Relational Semantics for Temporal STIT Logics
Kees van Berkel, Tim Lyon
We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm, Tstit and Xsti…