Bart Selman - Publications

Affiliations: 
Cornell University, Ithaca, NY, United States 
Area:
Computer Science

109 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Wu C, Zhang J, Selman B, Savarese S, Saxena A. Watch-Bot: Unsupervised learning for reminding humans of forgotten actions Proceedings - Ieee International Conference On Robotics and Automation. 2016: 2479-2486. DOI: 10.1109/ICRA.2016.7487401  1
2015 Xue Y, Ermon S, Gomes CP, Selman B. Uncovering hidden structure through parallel problem decomposition for the set basis problem: Application to materials discovery Ijcai International Joint Conference On Artificial Intelligence. 2015: 146-155.  1
2015 Xue Y, Ermon S, Gomes CP, Selman B. Uncovering hidden structure through parallel problem decomposition for the set basis problem: Application to materials discovery Ijcai International Joint Conference On Artificial Intelligence. 2015: 146-155.  1
2014 Sung J, Selman B, Saxena A. Synthesizing manipulation sequences for under-specified tasks using unrolled Markov Random Fields Ieee International Conference On Intelligent Robots and Systems. 2970-2977. DOI: 10.1109/IROS.2014.6942972  1
2014 Bras RL, Gomes CP, Selman B. On the erdos discrepancy problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8656: 440-448. DOI: 10.1007/978-3-319-10428-7_33  1
2014 Ermon S, Gomes CP, Sabharwal A, Selman B. Designing fast absorbing Markov chains Proceedings of the National Conference On Artificial Intelligence. 2: 849-855.  1
2014 Ermon S, Gomes CP, Sabharwal A, Selman B. Low-density parity constraints for hashing-based discrete integration 31st International Conference On Machine Learning, Icml 2014. 1: 452-462.  1
2013 Ermon S, Xue Y, Gomes C, Selman B. Learning policies for battery usage optimization in electric vehicles Machine Learning. 92: 177-194. DOI: 10.1007/s10994-013-5378-z  1
2013 Finger M, Le Bras R, Gomes CP, Selman B. Solutions for hard and soft constraints using optimized probabilistic satisfiability Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7962: 233-249. DOI: 10.1007/978-3-642-39071-5_18  1
2013 Ermon S, Gomes CP, Sabharwal A, Selman B. Embed and project: Discrete sampling with universal hashing Advances in Neural Information Processing Systems 1
2013 Le Bras R, Gomes CP, Selman B. Double-wheel graphs are graceful Ijcai International Joint Conference On Artificial Intelligence. 587-593.  1
2013 Ermon S, Gomes CP, Sabharwal A, Selman B. Taming the curse of dimensionality: Discrete integration by hashing and optimization 30th International Conference On Machine Learning, Icml 2013. 993-1001.  1
2013 Ermon S, Gomes CP, Sabharwal A, Selman B. Optimization with parity constraints: From binary codes to discrete integration Uncertainty in Artificial Intelligence - Proceedings of the 29th Conference, Uai 2013. 202-211.  1
2013 Le Bras R, Bernstein R, Gomes CP, Selman B, Van Dover RB. Crowdsourcing backdoor identification for combinatorial optimization Ijcai International Joint Conference On Artificial Intelligence. 2840-2847.  1
2012 Sung J, Ponce C, Selman B, Saxena A. Unstructured human activity detection from RGBD images Proceedings - Ieee International Conference On Robotics and Automation. 842-849. DOI: 10.1109/ICRA.2012.6224591  1
2012 Ermon S, Le Bras R, Gomes CP, Selman B, Van Dover RB. SMT-aided combinatorial materials discovery Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7317: 172-185. DOI: 10.1007/978-3-642-31612-8_14  1
2012 Hoffmann J, Selman B. Proceedings of the National Conference on Artificial Intelligence: Preface Proceedings of the National Conference On Artificial Intelligence. 1.  1
2012 Le Bras R, Gomes CP, Selman B. From streamlined combinatorial search to efficient constructive procedures Proceedings of the National Conference On Artificial Intelligence. 1: 499-506.  1
2012 Ermon S, Gomes CP, Sabharwal A, Selman B. Density Propagation and improved bounds on the partition function Advances in Neural Information Processing Systems. 4: 2762-2770.  1
2012 Ermon S, Gomes C, Selman B. Uniform solution sampling using a constraint solver as an oracle Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, Uai 2012. 255-264.  1
2012 Ermon S, Gomes C, Selman B, Vladimirsky A. Probabilistic planning with non-linear utility functions and worst-case guarantees 11th International Conference On Autonomous Agents and Multiagent Systems 2012, Aamas 2012: Innovative Applications Track. 1: 192-199.  1
2011 Ermon S, Gomes C, Selman B. A flat histogram method for computing the density of states of combinatorial problems Ijcai International Joint Conference On Artificial Intelligence. 2608-2613. DOI: 10.5591/978-1-57735-516-8/IJCAI11-434  1
2011 Ermon S, Conrad J, Gomes C, Selman B. Risk-sensitive policies for sustainable renewable resource allocation Ijcai International Joint Conference On Artificial Intelligence. 1942-1948. DOI: 10.5591/978-1-57735-516-8/IJCAI11-325  1
2011 Previti A, Ramanujan R, Schaerf M, Selman B. Monte-Carlo style UCT search for boolean satisfiability Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6934: 177-188. DOI: 10.1007/978-3-642-23954-0_18  1
2011 Previti A, Ramanujan R, Schaerf M, Selman B. Applying UCT to Boolean satisfiability Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6695: 373-374. DOI: 10.1007/978-3-642-21581-0_35  1
2011 Ramanujan R, Selman B. Trade-offs in sampling-based adversarial planning Icaps 2011 - Proceedings of the 21st International Conference On Automated Planning and Scheduling. 202-209.  1
2011 Ermon S, Gomes CP, Sabharwal A, Selman B. Accelerated Adaptive Markov Chain for partition function computation Advances in Neural Information Processing Systems 24: 25th Annual Conference On Neural Information Processing Systems 2011, Nips 2011 1
2011 Sung J, Ponce C, Selman B, Saxena A. Human activity detection from RGBD images Aaai Workshop - Technical Report. 47-55.  1
2010 Battiti R, Selman B, Stützle T. Special issue on learning and intelligent optimization Annals of Mathematics and Artificial Intelligence. 60: 1-2. DOI: 10.1007/s10472-011-9232-3  1
2010 Ermon S, Gomes CP, Selman B. Computing the density of states of boolean formulas Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6308: 38-52. DOI: 10.1007/978-3-642-15396-9_6  1
2010 Kroc L, Sabharwal A, Selman B. An empirical study of optimal noise and runtime distributions in local search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6175: 346-351. DOI: 10.1007/978-3-642-14186-7_31  1
2010 Kroc L, Sabharwal A, Selman B. Approximate inference for clusters in solution spaces Aaai Workshop - Technical Report. 38-41.  1
2010 Ramanujan R, Sabharwal A, Selman B. Understanding sampling style adversarial search methods Proceedings of the 26th Conference On Uncertainty in Artificial Intelligence, Uai 2010. 474-483.  1
2010 Ramanujan R, Sabharwal A, Selman B. On adversarial search spaces and sampling-based planning Icaps 2010 - Proceedings of the 20th International Conference On Automated Planning and Scheduling. 242-245.  1
2010 Ermon S, Conrad J, Gomes C, Selman B. Playing games against nature: Optimal policies for renewable resource allocation Proceedings of the 26th Conference On Uncertainty in Artificial Intelligence, Uai 2010. 168-176.  1
2009 Gomes CP, Sabharwal A, Selman B. Model counting Frontiers in Artificial Intelligence and Applications. 185: 633-654. DOI: 10.3233/978-1-58603-929-5-633  1
2009 Kautz H, Sabharwal A, Selman B. Incomplete algorithms Frontiers in Artificial Intelligence and Applications. 185: 185-203. DOI: 10.3233/978-1-58603-929-5-185  1
2009 Kroc L, Sabharwal A, Selman B. Message-passing and local heuristics as decimation strategies for satisfiability Proceedings of the Acm Symposium On Applied Computing. 1408-1414. DOI: 10.1145/1529282.1529596  1
2009 Kroc L, Sabharwal A, Selman B. Relaxed DPLL search for MaxSAT Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5584: 447-452. DOI: 10.1007/978-3-642-02777-2_41  1
2009 Kroc L, Sabharwal A, Selman B. Counting solution clusters in graph coloring problems using Belief Propagation Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference. 873-880.  1
2009 Kroc L, Sabharwal A, Gomes CP, Selman B. Integrating systematic and local search paradigms: A new strategy for MaxSAT Ijcai International Joint Conference On Artificial Intelligence. 544-551.  1
2008 Selman B. Computational science: a hard statistical view. Nature. 451: 639-40. PMID 18256654 DOI: 10.1038/451639a  1
2008 Gomes CP, Kautz H, Sabharwal A, Selman B. Chapter 2 Satisfiability Solvers Foundations of Artificial Intelligence. 3: 89-134. DOI: 10.1016/S1574-6526(07)03002-7  1
2008 Kroc L, Sabharwal A, Selman B. Leveraging belief propagation, backtrack search, and statistics for model counting Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5015: 127-141. DOI: 10.1007/978-3-540-68155-7_12  1
2007 Guo Y, Selman B. ExOpaque: A framework to explain opaque machine learning models using inductive logic programming Proceedings - International Conference On Tools With Artificial Intelligence, Ictai. 2: 226-229. DOI: 10.1109/ICTAI.2007.140  1
2007 Kautz H, Selman B. The state of SAT Discrete Applied Mathematics. 155: 1514-1524. DOI: 10.1016/j.dam.2006.10.004  1
2007 Selman B. Integration of learning and reasoning techniques Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4455: 25.  1
2007 Van Hoeve WJ, Gomes CP, Selman B, Lombardi M. Optimal multi-agent scheduling with constraint programming Proceedings of the National Conference On Artificial Intelligence. 2: 1813-1818.  1
2007 Gomes CP, Sabharwal A, Selman B. Near-uniform sampling of combinatorial spaces using XOR constraints Advances in Neural Information Processing Systems. 481-488.  1
2007 Kroc L, Sabharwal A, Selman B. Survey propagation revisited Proceedings of the 23rd Conference On Uncertainty in Artificial Intelligence, Uai 2007. 217-226.  1
2007 Vetsikas IA, Jennings NR, Selman B. Generating Bayes-Nash equilibria to design autonomous trading agents Ijcai International Joint Conference On Artificial Intelligence. 1543-1550.  1
2007 Gomes C, Hoffmann J, Sabharwal A, Selman B. Sampling and soundness: Can we have both? Ceur Workshop Proceedings. 291.  1
2007 Hoffmann J, Gomes C, Selman B, Kautz H. SAT encodings of state-space reachability problems in numeric domains Ijcai International Joint Conference On Artificial Intelligence. 1918-1923.  1
2007 Gomes CP, Hoffmann J, Sabharwal A, Selman B. From sampling to model counting Ijcai International Joint Conference On Artificial Intelligence. 2293-2299.  1
2007 Gomes CP, Hoffmann J, Sabharwal A, Selman B. Short XORs for model counting: From theory to practice Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4501: 100-106.  1
2007 Gomes CP, Van Hoeve WJ, Sabharwal A, Selman B. Counting CSP solutions using generalized XOR constraints Proceedings of the National Conference On Artificial Intelligence. 1: 204-209.  1
2006 Hoffmann J, Gomes C, Selman B. Structure and problem hardness: Goal asymmetry and DPLL proofs in SAT-based planning Icaps 2006 - Proceedings, Sixteenth International Conference On Automated Planning and Scheduling. 2006: 284-293.  1
2006 Gomes CP, Sabharwal A, Selman B. Model counting: A new strategy for obtaining good bounds Proceedings of the National Conference On Artificial Intelligence. 1: 54-61.  1
2006 Gomes CP, Van Hoeve WJ, Selman B. Constraint programming for distributed planning and scheduling Aaai Spring Symposium - Technical Report. 157-158.  1
2006 Interian Y, Corvera G, Selman B, Williams R. Finding small unsatisfiable cores to prove unsatisfiability of QBFs 9th International Symposium On Artificial Intelligence and Mathematics, Isaim 2006 1
2006 Sabharwal A, Ansotegui C, Gomes CP, Hart JW, Selman B. QBF modeling: Exploiting player symmetry for simplicity and efficiency Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4121: 382-395.  1
2005 Gomes CP, Selman B. Computational science: can get satisfaction. Nature. 435: 751-2. PMID 15944688 DOI: 10.1038/435751a  1
2005 Vetsikas IA, Selman B. Autonomous trading agent design in the presence of tradeoffs Acm International Conference Proceeding Series. 113: 293-299. DOI: 10.1145/1089551.1089607  1
2005 Béjar R, Domshlak C, Fernández C, Gomes C, Krishnamachari B, Selman B, Valls M. Sensor networks and distributed CSP: Communication, computation and complexity Artificial Intelligence. 161: 117-147. DOI: 10.1016/j.artint.2004.09.002  1
2005 Boufkhad Y, Dubois O, Interian Y, Selman B. Regular random k-SAT: Properties of balanced formulas Journal of Automated Reasoning. 35: 181-200. DOI: 10.1007/s10817-005-9012-z  1
2005 Wei W, Selman B. A new approach to model counting Lecture Notes in Computer Science. 3569: 324-339.  1
2005 Ansotegui C, Gomes CP, Selman B. The achilles' heel of QBF Proceedings of the National Conference On Artificial Intelligence. 1: 275-281.  1
2005 Jia H, Moore C, Selman B. From spin glasses to hard satisfiable formulas Lecture Notes in Computer Science. 3542: 199-210.  1
2004 Hopcroft J, Khan O, Kulis B, Selman B. Tracking evolving communities in large linked networks. Proceedings of the National Academy of Sciences of the United States of America. 101: 5249-53. PMID 14757820 DOI: 10.1073/pnas.0307750100  1
2004 Gomes CP, Fernández C, Selman B, Bessiere C. Statistical regimes across constrainedness regions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3258: 32-46. DOI: 10.1007/s10601-005-2807-z  1
2004 Selman B. Algorithmic adventures at the interface of computer science, statistical physics, and combinatorics (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3258: 9-12.  1
2004 Vetsikas IA, Selman B. A methodology and equilibria for design tradeoffs of autonomous trading agents Proceedings of the Third International Joint Conference On Autonomous Agents and Multiagent Systems, Aamas 2004. 3: 1286-1287.  1
2004 Wei W, Erenrich J, Selman B. Towards efficient sampling: Exploiting random walk strategies Proceedings of the National Conference On Artificial Intelligence. 670-676.  1
2003 Hopcroft J, Khan O, Kulis B, Selman B. Natural communities in large linked networks Proceedings of the Acm Sigkdd International Conference On Knowledge Discovery and Data Mining. 541-546. DOI: 10.1145/956750.956816  1
2003 Ferentinos KP, Albright LD, Selman B. Neural network-based detection of mechanical, sensor and biological faults in deep-trough hydroponics Computers and Electronics in Agriculture. 40: 65-85. DOI: 10.1016/S0168-1699(03)00012-7  1
2003 Erenrich J, Selman B. Sampling combinatorial spaces using biased random walks Ijcai International Joint Conference On Artificial Intelligence. 1376-1378.  1
2003 Kautz H, Selman B. Ten challenges redux: Recent progress in propositional reasoning and search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2833: 1-18.  1
2003 Vetsikas IA, Selman B. A Principled Study of the Design Tradeoffs for Autonomous Trading Agents Proceedings of the Interantional Conference On Autonomous Agents. 2: 473-480.  1
2003 Williams R, Gomes CP, Selman B. Backdoors to typical case complexity Ijcai International Joint Conference On Artificial Intelligence. 1173-1178.  1
2003 Bejar R, Domshlak C, Fernandez C, Gomes C, Selman B, Vails M. Grid-based SensorDCSP Ijcai International Joint Conference On Artificial Intelligence. 1359-1361.  1
2002 Gomes CP, Selman B. Computer science. Satisfied with physics. Science (New York, N.Y.). 297: 784-5. PMID 12161641 DOI: 10.1126/science.1074599  1
2002 Wei W, Selman B. Accelerating random walks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2470: 216-232.  1
2002 Kautz H, Horvitz E, Ruan Y, Gomes C, Selman B. Dynamic restart policies Proceedings of the National Conference On Artificial Intelligence. 674-681.  1
2001 Kautz H, Selman B. Preface. Volume 9 Electronic Notes in Discrete Mathematics. 9: 1. DOI: 10.1016/S1571-0653(04)00309-9  1
2001 Dubois O, Monasson R, Selman B, Zecchina R. Theoretical Computer Science: Editorial Theoretical Computer Science. 265: 1. DOI: 10.1016/S0304-3975(01)00133-5  1
2001 Gomes CP, Selman B. Algorithm portfolios Artificial Intelligence. 126: 43-62. DOI: 10.1016/S0004-3702(00)00081-3  1
2001 Chen H, Gomes C, Selman B. Formal models of heavy-tailed behavior in combinatorial search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2239: 408-421.  1
2001 Kautz H, Ruan Y, Achlioptas D, Gomes C, Selman B, Stickel M. Balance and filtering in structured satisfiable problems (preliminary report) Electronic Notes in Discrete Mathematics. 9: 2-18.  1
2001 Horvitz E, Ruan Y, Gomes C, Kautz H, Selman B, Chickering M. A Bayesian approach to tackling hard computational problems (preliminary report) Electronic Notes in Discrete Mathematics. 9: 376-391.  1
2000 Krishnamachari B, Xie X, Selman B, Wicker S. Analysis of random noise and random walk algorithms for satisfiability testing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1894: 278-290.  1
2000 Gomes CP, Selman B, Crato N, Kautz H. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems Journal of Automated Reasoning. 24: 67-100.  1
1999 Monasson R, Zecchina R, Kirkpatrick S, Selman B, Troyansky L. Determining computational complexity from characteristic 'phase transitions' Nature. 400: 133-137. DOI: 10.1038/22055  1
1999 Kautz H, Selman B. Unifying SAT-based and graph-based planning Ijcai International Joint Conference On Artificial Intelligence. 1: 318-325.  1
1999 Monasson R, Zecchina R, Kirkpatrick S, Selman B, Troyansky L. 2 + p-SAT: Relation of typical-case complexity to the nature of the phase transition Random Structures and Algorithms. 15: 414-435.  1
1997 Kautz H, Selman B, Shah M. The hidden web Ai Magazine. 18: 27-35.  1
1997 Selman B, Kautz H, McAllester D. Ten challenges in propositional reasoning and search Ijcai International Joint Conference On Artificial Intelligence. 1: 50-54.  1
1997 Gomes CP, Selman B, Crato N. Heavy-tailed distributions in combinatorial search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1330: 121-135.  1
1997 Kautz H, Selman B, Shah M. Combining Social Networks and Collaborative Filtering Communications of the Acm. 40: 63-65.  1
1996 Selman B, Kirkpatrick S. Critical behavior in the computational cost of satisfiability testing Artificial Intelligence. 81: 273-295.  1
1996 Selman B, Kautz H. Knowledge compilation and theory approximation Journal of the Acm. 43: 193-224.  1
1996 Selman B, Levesque HJ. Support set selection for abductive and default reasoning Artificial Intelligence. 82: 259-272.  1
1996 Selman B, Mitchell DG, Levesque HJ. Generating hard satisfiability problems Artificial Intelligence. 81: 17-29.  1
1995 Kautz H, Kearns M, Selman B. Horn approximations of empirical data Artificial Intelligence. 74: 129-145. DOI: 10.1016/0004-3702(94)00072-9  1
1994 Kautz HA, Selman B, Coen M. Bottom-Up Design of Software Agents Communications of the Acm. 37: 143-146. DOI: 10.1145/176789.176805  1
1994 Kirkpatrick S, Selman B. Critical behavior in the satisfiability of random Boolean expressions Science. 264: 1297-1301.  1
1993 Selman B, Levesque HJ. The complexity of path-based defeasible inheritance Artificial Intelligence. 62: 303-339. DOI: 10.1016/0004-3702(93)90081-L  1
1991 Kautz HA, Selman B. Hard problems for simple default logics Artificial Intelligence. 49: 243-279. DOI: 10.1016/0004-3702(91)90011-8  1
1990 Selman B, Kautz HA. Model-preference default theories Artificial Intelligence. 45: 287-322. DOI: 10.1016/0004-3702(90)90010-W  1
1989 Selman B. Connectionist systems for natural language understanding Artificial Intelligence Review. 3: 23-31. DOI: 10.1007/BF00139194  1
Show low-probability matches.