Toulouse, Occitanie, France
403 followers 389 connections

Join to view profile

About

I focus on building the right thing. I lead people into product thinking, and help…

Activity

Join now to see all activity

Experience & Education

  • CyberArk

View Maël’s full experience

See their title, tenure and more.

or

By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement, Privacy Policy, and Cookie Policy.

Publications

  • Compact Tree Encodings for Planning as QBF

    Inteligencia Artificial (Ibero-American Journal of Artificial Intelligence), pp. 103-114, Vol 21, Nº62, 2018

    Considerable improvements in the technology and per- formance of SAT and QBF solvers has made it pos- sible to use them for the resolution of various prob- lems in Artificial Intelligence, and among them the problem of generating plans. In this article we present a translation from STRIPS planning problems into quantified propositional formulas. We introduce two new encodings: CTE-EFA based on explanatory frame-axioms, and CTE-OPEN based on causal links. Then we compare both of them to the…

    Considerable improvements in the technology and per- formance of SAT and QBF solvers has made it pos- sible to use them for the resolution of various prob- lems in Artificial Intelligence, and among them the problem of generating plans. In this article we present a translation from STRIPS planning problems into quantified propositional formulas. We introduce two new encodings: CTE-EFA based on explanatory frame-axioms, and CTE-OPEN based on causal links. Then we compare both of them to the CTE-NOOP encoding which is based on No-op actions (Cashmore, Fox, and Giunchiglia 2012). In terms of execution time over benchmark problems, CTE-EFA and CTE-OPEN always performed better than CTE-NOOP.

    Other authors
    See publication

  • Twist your logic with TouIST

    International Congress on Tools for Teaching Logic (ICTTL 2015)

    Khaled Skander Ben Slimane, Alexis Comte, Olivier Gasquet, Abdelwahab Heba, Olivier Lezaud, Frederic Maris and Mael Valais

    SAT provers are powerful tools for solving real-sized logic problems, but using them requires solid programming knowledge and may be seen w.r.t. logic like assembly language w.r.t. programming. Something like a high level language was missing to ease various users to take benefit of these tools. TouIST aims at filling this gap. It is devoted to propositional logic…

    Khaled Skander Ben Slimane, Alexis Comte, Olivier Gasquet, Abdelwahab Heba, Olivier Lezaud, Frederic Maris and Mael Valais

    SAT provers are powerful tools for solving real-sized logic problems, but using them requires solid programming knowledge and may be seen w.r.t. logic like assembly language w.r.t. programming. Something like a high level language was missing to ease various users to take benefit of these tools. TouIST aims at filling this gap. It is devoted to propositional logic and its main features are 1) to offer a high-level logic langage for expressing succintly complex formulas (e.g. formulas describing Sudoku rules, planification problems, …) and 2) to find models to these formulas by using the adequate powerful prover, which the user has no need to know about. It consists in a friendly interface that offers several syntactic facilities and which is connected with some sufficiently powerful provers allowing to automatically solve big instances of difficult problems (such as time-tables or Sudokus). It can interact with various provers: pure SAT solver but also SMT provers (SAT modulo theories - like linear theory of reals, etc) and thus may also be used by beginners for experiencing with pure propositional problems up to graduate students or even researchers for solving planification problems involving big sets of fluents and numerical constraints on them.

    Other authors
    See publication

  • Transport humanitaire et la logistique de crise : comparaison de deux méthodes de calcul de tournées de véhicules

    Cet article étudie deux méthodes utilisées dans le cadre du transport humanitaire en cas de crise (désastre, épidémie...). Le Covering Tour Problem se focalise sur l'équité de distribution des vivres, alors que le Capacitated Vehicle Routing Problem se concentre sur l'urgence de la distribution. Nous proposons une nouvelle approche mélangeant ces deux approches pour former une solution à la fois équitable et rapide.
    Ce article a été rédigé dans le cadre du TER 2014-2015 a cours du M1 à…

    Cet article étudie deux méthodes utilisées dans le cadre du transport humanitaire en cas de crise (désastre, épidémie...). Le Covering Tour Problem se focalise sur l'équité de distribution des vivres, alors que le Capacitated Vehicle Routing Problem se concentre sur l'urgence de la distribution. Nous proposons une nouvelle approche mélangeant ces deux approches pour former une solution à la fois équitable et rapide.
    Ce article a été rédigé dans le cadre du TER 2014-2015 a cours du M1 à l'université Toulouse III - Paul Sabatier.

    Other authors
    See publication

Projects

  • TouIST, l'outil pour exprimer les problèmes de logique propositionnelle

    -

    Outil basé sur un solveur de logique propositionnelle proposant un langage de haut niveau ainsi qu'une interface utilisateur adaptée à l'enseignement et à la recherche. Toute la force de Touist repose sur son langage : il permet à l'utilisateur l'expression de formules condensées, réduisant considérablement l'écriture des problèmes ; Touist permet aussi de séparer les formules (c'est à dire le coeur du raisonnement) des données.
    Un article présentant l'outil a été présenté lors de la…

    Outil basé sur un solveur de logique propositionnelle proposant un langage de haut niveau ainsi qu'une interface utilisateur adaptée à l'enseignement et à la recherche. Toute la force de Touist repose sur son langage : il permet à l'utilisateur l'expression de formules condensées, réduisant considérablement l'écriture des problèmes ; Touist permet aussi de séparer les formules (c'est à dire le coeur du raisonnement) des données.
    Un article présentant l'outil a été présenté lors de la conférence internationale "TTL 2015" à Rennes.

    Other creators
    See project

Honors & Awards

  • Doctoral Fellowship Laureate

    CIMI LabEx, Toulouse

    The CIMI LabEx (International Centre for Mathematics and Computer Science, Excellence Laboratory in Toulouse) offers a 3-year support grant for students starting a PhD in one of the teams related to mathematics and computer science. These fellowships are open, on a competitive basis, to French and foreign students and awarded on the basis of the quality of the academic records. I was awarded with this fellowship.

  • Master Fellowship Laureate

    CIMI LabEx, Toulouse

    The CIMI LabEx (International Center for Mathematics and Computer Science, Excellence Laboratory in Toulouse) offers master's scholarships in mathematics and computer science. Selected on the criteria of academic excellence, each of the ten laureates each year are rewarded up to 10,000 euros distributed during their last year of Master's degree.

Test Scores

  • Maël Valais

    Score: 1er sur 10

Languages

  • Anglais

    Full professional proficiency

  • Français

    Native or bilingual proficiency

  • Espagnol

    Elementary proficiency

  • Khmer

    Elementary proficiency

Organizations

  • Université Toulouse III - Paul Sabatier

    -

Recommendations received

2 people have recommended Maël

Join now to view

More activity by Maël

View Maël’s full profile

  • See who you know in common
  • Get introduced
  • Contact Maël directly
Join to view full profile

Other similar profiles

Explore more posts

Explore top content on LinkedIn

Find curated posts and insights for relevant topics all in one place.

View top content

Add new skills with these courses

See all courses