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
12 papers · 2 filters
SAT Solving for Variants of First-Order Subsumption
Robin Coutelier, Jakob Rath, Michael Rawson +2
Automated reasoners, such as SAT/SMT solvers and first-order provers, are becoming the backbones of rigorous systems engineering, being used for example in applications of system v…
Neural logic programs and neural nets
Christian Antić
Neural-symbolic integration aims to combine the connectionist subsymbolic with the logical symbolic approach to artificial intelligence. In this paper, we first define the answer s…
Dyadic obligations: proofs and countermodels via hypersequents
Agata Ciabattoni, Nicola Oliveti, Xavier Parent
The basic system E of dyadic deontic logic proposed by Åqvist offers a simple solution to contrary-to-duty paradoxes and allows to represent norms with exceptions. We investigate E…
Logic-based analogical proportions
Christian Antić
The author has recently introduced an abstract algebraic framework of analogical proportions within the general setting of universal algebra. The purpose of this paper is to lift t…
Analogical proportions II
Christian Antić
Analogical reasoning is the ability to detect parallels between two seemingly distant objects or situations, a fundamental human capacity used for example in commonsense reasoning,…
SMT-based Symbolic Model-Checking for Operator Precedence Languages
Michele Chiari, Luca Geatti, Nicola Gigante +1
Operator Precedence Languages (OPL) have been recently identified as a suitable formalism for model checking recursive procedural programs, thanks to their ability of modeling the…