A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers.
Roberto Javier Asín AcháRodrigo LópezSebastián HagedornJorge A. BaierPublished in: SOCS (2021)
Keyphrases
- sat solvers
- pseudo boolean
- sat encodings
- maximum satisfiability
- integer linear programming
- combinatorial problems
- answer set programming
- propositional satisfiability
- boolean formula
- sat problem
- symmetry breaking
- sat solving
- sat instances
- max sat
- boolean satisfiability
- real valued
- upper bound
- web applications
- encoding scheme
- boolean functions
- satisfiability modulo theories
- search space
- orders of magnitude
- search strategies
- branch and bound algorithm
- combinatorial optimization
- constraint programming
- boolean queries
- declarative programming
- data sets
- constraint satisfaction
- fractal image compression
- modulo theories
- encoding schemes
- multi valued
- highly optimized
- conjunctive normal form
- answer sets
- vector quantization
- lower bound
- search algorithm
- video sequences