1.8k citations
- Centre National de la Recherche ScientifiqueFR262 papers
- University of ViennaAT182 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR177 papers
- Charles UniversityCZ176 papers
- European Organization for Nuclear ResearchCH171 papers
- Institute of High Energy PhysicsCN164 papers
- Université Paris-SaclayFR163 papers
- CEA Paris-SaclayFR157 papers
- University of BolognaIT150 papers
- Centro de Investigaciones Energéticas, Medioambientales y TecnológicasES148 papers
- Helsinki Institute of PhysicsFI148 papers
- ETH ZurichCH146 papers
8 papers · 2 filters
Quantitative and Stream Extensions of Answer Set Programming
Rafael Kiesel
Answer Set Programming has separately been extended with constraints, to the streaming domain, and with capabilities to reason over the quantities associated with answer sets. We p…
A Fixed-point Theorem for Horn Formula Equations
Stefan Hetzl, Johannes Kloibhofer
We consider constrained Horn clause solving from the more general point of view of solving formula equations. Constrained Horn clauses correspond to the subclass of Horn formula eq…
First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving
Wolfgang Schreiner, Franz-Xaver Reichl
In this paper, we compare two alternative mechanisms for deciding the validity of first-order formulas over finite domains supported by the mathematical model checker RISCAL: first…
Automating Induction by Reflection
Johannes Schoisswohl, Laura Kovács
Despite recent advances in automating theorem proving in full first-order theories, inductive reasoning still poses a serious challenge to state-of-the-art theorem provers. The rea…
Uniform interpolation via nested sequents and hypersequents
Iris van der Giessen, Raheleh Jalali, Roman Kuznets
A modular proof-theoretic framework was recently developed to prove Craig interpolation for normal modal logics based on generalizations of sequent calculi (e.g., nested sequents,…
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics
A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proo…