Open AccessA hybrid bit-encoding for SAT planning based on clique-partitioning
Author(s) -
Cristóbal Tapia,
Pablo San Segundo,
Ramón Galán
Publication year - 2017
Publication title -
aip conference proceedings
Language(s) - English
Resource type - Conference proceedings
eISSN - 1551-7616
pISSN - 0094-243X
DOI - 10.1063/1.4996672
Subject(s) - encoding (memory) , boolean satisfiability problem , satisfiability , computer science , partition (number theory) , conjunctive normal form , theoretical computer science , encode , maximum satisfiability problem , bitwise operation , solver , clique , algorithm , boolean function , mathematics , artificial intelligence , combinatorics , programming language , biochemistry , chemistry , gene
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom