Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Jeriah Jn Charles-Blount"'
Publikováno v:
Artificial Intelligence Review. 49:439-453
Boolean Satisfiability (SAT) is an important problem in many domains. Modern SAT solvers have been widely used in important industrial applications including automated planning and verification. To solve more problems in real applications, new techni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a28d911c1c3b4137af13346bf7106707
https://doi.org/10.1007/s10462-016-9530-6
https://doi.org/10.1007/s10462-016-9530-6
