Concept
Philosophie de la logique
Publications associées (38)
Interpolation and Quantifiers in Ortholattices
Viktor Kuncak, Simon Guilloud, Sankalp Gambhir
We study quantifiers and interpolation properties in ortho- logic, a non-distributive weakening of classical logic that is sound for formula validity with respect to classical logic, yet has a quadratic-time decision procedure. We present a sequent-based p ...
2024Orthologic with Axioms
We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras while having po ...
Analysing the potential for modal shiftbased on the logic of modal choice
Vincent Kaufmann, Eloi Antoine Maël Bernier, Florian Lucien Jacques Masse, Ludy Juliana González Villamizar
This article explores how the logic underlying modal practices tends to modulate the population’s responsiveness to improvements in global transport supply. Based on a quantitative survey conducted in 2018–2019 among the working population of the cantons o ...
2023Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment
Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên
The task of discovering equivalent entities in knowledge graphs (KGs), so-called KG entity alignment, has drawn much attention to overcome the incompleteness problem of KGs. The majority of existing techniques learns the pointwise representations of entiti ...
London2023Exact DAG-Aware Rewriting
We present a generic resynthesis framework for optimizing Boolean networks parameterized with a multi-level logic representation, a cut-computation algorithm, and a resynthesis algorithm. The framework allows us to realize powerful optimization algorithms ...
IEEE2020Busy Man’s Synthesis: Combinational Delay Optimization With SAT
Giovanni De Micheli, Mathias Soeken
Boolean SAT solving can be used to find a minimum- size logic network for a given small Boolean function. This paper extends the SAT formulation to find a minimum-size network under delay constraints. Delay constraints are given in terms of input arrival t ...
Ieee2017