Zobrazeno 1 - 10
of 118
pro vyhledávání: '"Bart Selman"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 3, Issue 1 (2007)
In Verification and in (optimal) AI Planning, a successful method is to formulate the application as boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedures. There is a lack of understanding of why this works so well. F
Externí odkaz:
https://doaj.org/article/d55403a8a14c4ef1a8de8ca801b34d14
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 26:499-506
In recent years, significant progress in the area of search, constraint satisfaction, and automated reasoning has been driven in part by the study of challenge problems from combinatorics and finite algebra. This work has led to the discovery of inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42ca8e59085d0fca358e03a3798c5382
https://doi.org/10.1609/aaai.v26i1.8147
https://doi.org/10.1609/aaai.v26i1.8147
Autor:
Sebastian Ament, John M. Gregoire, Wenting Zhao, R. Bruce van Dover, Dan Guevarra, Di Chen, Lan Zhou, Yiwei Bai, Carla P. Gomes, Bart Selman
Publikováno v:
Nature Machine Intelligence. 3:812-822
Crystal-structure phase mapping is a core, long-standing challenge in materials science that requires identifying crystal phases, or mixtures thereof, in X-ray diffraction measurements of synthesized materials. Phase mapping algorithms have been deve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4728d892ac70389db8ef4c1ef0bdd1aa
https://doi.org/10.1038/s42256-021-00384-1
https://doi.org/10.1038/s42256-021-00384-1
Autor:
Jose A. Barreiros, Artemis Xu, Sofya Pugach, Narahari Iyengar, Graeme Troxell, Alexander Cornwell, Samantha Hong, Bart Selman, Robert F. Shepherd
Publikováno v:
Science robotics. 7(67)
Flesh encodes a variety of haptic information including deformation, temperature, vibration, and damage stimuli using a multisensory array of mechanoreceptors distributed on the surface of the human body. Currently, soft sensors are capable of detect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3bf79e53fedc86a8cf4f2a9f4209ddd
https://pubmed.ncbi.nlm.nih.gov/35675451
https://pubmed.ncbi.nlm.nih.gov/35675451
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 20:242-245
Upper Confidence bounds applied to Trees (UCT), a bandit-based Monte-Carlo sampling algorithm for planning, has recently been the subject of great interest in adversarial reasoning. UCT has been shown to outperform traditional minimax based approache
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c0fb889b43657def2ce35c0f9f73632
https://doi.org/10.1609/icaps.v20i1.13437
https://doi.org/10.1609/icaps.v20i1.13437
Autor:
Bistra Dilkina, Bart Selman, Daniel Freund, Warren B. Powell, Stefano Ermon, Steve Kelling, Angela K. Fuller, Alexander S. Flecker, John S. Selker, Carla P. Gomes, Douglas H. Fisher, Yexiang Xue, Milind Tambe, Mary Lou Zeeman, Fei Fang, Xiaoli Z. Fern, Christopher B. Barrett, Xiaojian Wu, John M. Gregoire, Alan Fern, Zico Kolter, John E. Hopcroft, Daniel Fink, Andrew Farnsworth, David B. Shmoys, Jon M. Conrad, Nicole D. Sintov, Thomas G. Dietterich, Abdul-Aziz Yakubu, Amulya Yadav, Daniel Sheldon, Christopher L. Wood, Weng-Keen Wong
Publikováno v:
Communications of the ACM. 62:56-65
Computer and information scientists join forces with other fields to help solve societal and environmental challenges facing humanity, in pursuit of a sustainable future.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c1226eb22d7f55e7d9b7069cc82f5bc
https://doi.org/10.1145/3339399
https://doi.org/10.1145/3339399
Publikováno v:
MRS Bulletin. 44:538-544
Continued progress in artificial intelligence (AI) and associated demonstrations of superhuman performance have raised the expectation that AI can revolutionize scientific discovery in general and materials science specifically. We illustrate the suc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::690892c456a3db2a1afd641296dbe5e9
https://doi.org/10.1557/mrs.2019.158
https://doi.org/10.1557/mrs.2019.158
Publikováno v:
Frontiers in Artificial Intelligence and Applications
Model counting, or counting the number of solutions of a propositional formula, generalizes SAT and is the canonical #P-complete problem. Surprisingly, model counting is hard even for some polynomial-time solvable cases like 2-SAT and Horn-SAT. Effic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1be676324a017ac344c2b1249daac1f
https://doi.org/10.3233/faia201009
https://doi.org/10.3233/faia201009
Research on incomplete algorithms for satisfiability testing lead to some of the first scalable SAT solvers in the early 1990’s. Unlike systematic solvers often based on an exhaustive branching and backtracking search, incomplete methods are genera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35b3139c6fa3da2351a314795ee053ca
https://doi.org/10.3233/faia200989
https://doi.org/10.3233/faia200989