-
Efficient decoding of some classes of binary cyclic codes beyond the Hartmann...
International audience -
Superposition with Equivalence Reasoning andDelayed Clause Normal Form Transf...
This report describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have... -
A Finite First-Order Presentation of Set Theory
We present a first-order formalization of set theory which has a finite number of axioms. Its syntax is similar to that often used in textbooks: it provides an... -
Collections, Sets and Types
Projet COQ -
Harnessing SMT Solvers for TLA+ Proofs
International audience -
Necessary and sufficient condition for stabilizability of discrete-time linea...
International audience -
Proof reconstruction for first-order logic and set-theoretical constructions
Proof reconstruction is a technique that combines an interactive theorem prover and an automatic one in a sound way, so that users benefit of the expressiveness of the... -
Why Innovative Design Requires New Scientific Foundations for Manageable Iden...
International audience -
Latest Developments on the IEEE 1788 Effort for the Standardization of Interv...
(Standardization effort supported by the INRIA D2T.) -
On the Near-Field Shaping and Focusing Capability of a Radial Line Slot Array
International audience -
Click'n'Prove: Interactive Proofs Within Set Theory
Colloque avec actes et comité de lecture. internationale.
