Quentin Cohen-Solal

University of Caen Normandy | UNICAEN

Monte Carlo Tree Search can be used for automated theorem proving. Holophrasm is a neural theorem prover using MCTS combined with neural networks for the policy and the evaluation. In this paper we propose to improve the performance of the Holophrasm theorem prover using other game tree search algorithms.

In this article, we prove the completeness of the following game search algorithms: unbounded best-first minimax with completion and descent with completion, i.e. we show that, with enough time, they find the best game strategy. We then generalize these two algorithms in the context of perfect information multiplayer games. We show that these gener...

In this paper, we focus on qualitative temporal sequences of topological information. We firstly consider the context of topological temporal sequences of length greater than 3 describing the evolution of regions at consecutive time points. We show that there is no Cartesian subclass containing all the basic relations and the universal relation for...

In this paper, we focus on qualitative temporal sequences of topological information. We firstly consider the context of topological temporal sequences of length greater than 3 describing the evolution of regions at consecutive time points. We show that there is no Cartesian subclass containing all the basic relations and the universal relation for...

Parmi les différentes formes de raisonnement étudiées dans le contexte de l'intelligence artificielle, le raisonnement qualitatif permet d'inférer de nouvelles connaissances dans le contexte d'informations imprécises, incomplètes et dépourvues de valeurs numériques. Il permet par exemple de déduire de nouvelles informations à partir d'un ensemble d...

Relying on the recently introduced multi-algebras, we present a general approach for reasoning about temporal sequences of qualitative information that is generally more efficient than existing techniques. Applying our approach to the specific case of sequences of topological information about constant-size regions, we show that the resulting forma...

Nous présentons une approche générale pour le raison-nement sur des séquences temporelles d'informations quali-tatives. Cette approche, qui s'appuie sur le cadre récemment introduit des multialgèbres, est de façon générale plus effi-cace computationnellement que les techniques de la littéra-ture. Nous appliquons notre approche au cas spécifique des...

Nous étudions le problème de la décision de la cohérence de réseaux de contraintes dans le cadre de combinaisons de formalismes qualitatifs. Nous proposons un cadre formel qui englobe les intégrations lâches, le raisonnement multiéchelle et une forme de raisonnement spatio-temporel. En particulier, nous identifions des conditions suffisantes assura...

We study the problem of consistency checking for constraint networks over combined qualitative formalisms. We propose a framework which encompasses loose integrations and a form of spatio-temporal reasoning. In particular, we identify sufficient conditions ensuring the polynomiality of consistency checking, and we use them to find tractable subclas...

We study the problem of consistency checking for constraint networks over combined qualitative formalisms. We propose a framework which encompasses loose integrations and a form of spatio-temporal reasoning. In particular, we identify sufficient conditions ensuring the polynomiality of consistency checking, and we use them to find tractable subclas...

In this paper, we propose a qualitative formalism for representing and reasoning about time at differ- ent scales. It extends the results of Euzenat [1995] concerning time and overcomes their major limi- tations, allowing one to reason about relations be- tween points and intervals. Our approach is more expressive than most algebras of temporal rel...

The aim of this paper is to gather several results concerning the enumeration of specific classes of polycubes. We first consider two classes of 3-dimensional vertically-convex directed polycubes: the plateau polycubes and the parallelogram polycubes. An expression of the generating function is provided for the former class, as well as an asymptoti...