-
A zero-one law for first-order logic on random images
International audience -
On the Complexity of Entailment in Existential Conjunctive First Order Logic ...
We consider the entailment problem in the fragment of first-order logic (FOL) composed of existentially closed conjunctions of literals (without functions), denoted... -
Product robustness management : formalization by formal logic, application to...
This work is oriented towards the variation management within the embodiment design phase of a product. It focuses on management and integration of design parameter... -
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... -
Petri Net Reachability Graphs: Decidability Status of First Order Properties
International audience -
Automated Synthesis of a Finite Complexity Ordering for Saturation
We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A < B implies Var(A) ⊆... -
The Limits of Decidability for First Order Logic on CPDA Graphs
International audience -
On the Complexity of Entailment in Existential Conjunctive First Order Logic ...
International audience -
Schützenberger and Eilenberg theorems for words on linear orderings
International audience -
A unified approach to structural limits, and limits of graphs with bounded tr...
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of... -
Accessing and using complex multimedia documents in a digital library
In the context of three European projects, our research team has developed a data model and query language for digital libraries supporting identification,... -
Modeling Limits in Hereditary Classes: Reduction and Application to Trees
Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and... -
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... -
A Resolution Calculus for First-order Schemata
International audience -
Supervised Relational Machine Learning using Evolutionary Algorithms
U.F.R. Scientifique d'Orsay N° d'ordre: 6420 -
Local Normal Forms for First-Order Logic with Applications to Games and Automata
International audience -
Automated Deduction Techniques for Studying Rough Algebras
Article dans revue scientifique avec comité de lecture. -
Sequent Calculus Viewed Modulo
Colloque avec actes et comité de lecture. internationale.
