Chop-SAT: A New Approach to Solving SAT and Probabilistic SAT for Agent Knowledge Bases.
Thomas C. HendersonDavid SacharnyAmar MiticheXiuyi FanAmelia C. LessenIshaan RajanTessa NishidaPublished in: ICAART (3) (2023)
Keyphrases
- sat solvers
- satisfiability problem
- sat solving
- stochastic local search
- sat instances
- propositional satisfiability
- sat problem
- sat encodings
- variable ordering
- boolean satisfiability
- stochastic local search algorithms
- max sat
- np complete problems
- knowledge base
- phase transition
- solving hard
- knowledge based systems
- solving problems
- graph coloring
- propositional formulas
- search strategies
- dynamic environments
- search space
- multi agent systems
- search algorithm