SAT as a game

11/03/2015
by   Olivier Bailleux, et al.
0

We propose a funny representation of SAT. While the primary interest is to present propositional satisfiability in a playful way for pedagogical purposes, it could also inspire new search heuristics.

READ FULL TEXT

page 1

page 2

page 3

research
11/07/2018

SAT-based Explicit LTLf Satisfiability Checking

We present here a SAT-based framework for LTLf (Linear Temporal Logic on...
research
09/27/2019

SAT vs CSP: a commentary

In 2000, I published a relatively comprehensive study of mappings betwee...
research
05/27/2020

Neural heuristics for SAT solving

We use neural graph networks with a message-passing architecture and an ...
research
04/16/2013

Mining to Compact CNF Propositional Formulae

In this paper, we propose a first application of data mining techniques ...
research
05/24/2021

GraphSAT – a decision problem connecting satisfiability and graph theory

Satisfiability of boolean formulae (SAT) has been a topic of research in...
research
05/18/2021

Reconfiguring Hybrid Systems Using SAT

Reconfiguration aims at recovering a system from a fault by automaticall...
research
07/26/2012

On When and How to use SAT to Mine Frequent Itemsets

A new stream of research was born in the last decade with the goal of mi...

Please sign up or login with your details

Forgot password? Click here to reset