BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × Finland
1 × Germany
1 × Italy
1 × Portugal
3 × Canada
3 × United Kingdom
9 × USA
Collaborated with:
H.A.Kautz A.Sabharwal C.P.Gomes L.Kroc S.Ermon H.Jia C.Moore W.Wei R.LeBras Y.Ruan Y.Huang D.A.McAllester M.Finger A.Previti R.Ramanujan M.Schaerf J.Hoffmann J.E.Hopcroft O.Khan B.Kulis R.B.v.Dover C.Ansótegui J.W.Hart E.Horvitz D.M.Chickering D.Achlioptas M.E.Stickel
Talks about:
satisfi (7) hard (5) problem (4) optim (4) constraint (3) model (3) plan (3) approach (2) formula (2) discret (2)

Person: Bart Selman

DBLP DBLP: Selman:Bart

Facilitated 1 volumes:

KR 2000Ed

Contributed to:

ICML c1 20142014
ICML c2 20132013
SAT 20132013
SAT 20122012
SAT 20112011
SAT 20102010
SAC 20092009
SAT 20092009
SAT 20072007
SAT 20062006
SAT 20052005
SAT 20042004
SAT 20042005
KDD 20032003
SAT 20012001
ICML 20002000
LICS 20002000
KR 19961996
KR 19941994
KR 19891989

Wrote 22 papers:

ICML-c1-2014-ErmonGSS #constraints #integration
Low-density Parity Constraints for Hashing-Based Discrete Integration (SE, CPG, AS, BS), pp. 271–279.
ICML-c2-2013-ErmonGSS #integration #optimisation
Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization (SE, CPG, AS, BS), pp. 334–342.
SAT-2013-FingerLGS #constraints #probability #satisfiability #using
Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability (MF, RL, CPG, BS), pp. 233–249.
SAT-2012-ErmonLGSD #combinator
SMT-Aided Combinatorial Materials Discovery (SE, RL, CPG, BS, RBvD), pp. 172–185.
SAT-2011-PrevitiRSS #satisfiability
Applying UCT to Boolean Satisfiability (AP, RR, MS, BS), pp. 373–374.
SAT-2010-KrocSS #empirical #runtime
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search (LK, AS, BS), pp. 346–351.
SAC-2009-KrocSS #heuristic #message passing #satisfiability
Message-passing and local heuristics as decimation strategies for satisfiability (LK, AS, BS), pp. 1408–1414.
SAT-2009-KrocSS #satisfiability
Relaxed DPLL Search for MaxSAT (LK, AS, BS), pp. 447–452.
SAT-2007-GomesHSS #theory and practice
Short XORs for Model Counting: From Theory to Practice (CPG, JH, AS, BS), pp. 100–106.
SAT-2006-SabharwalAGHS #modelling #performance #symmetry
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency (AS, CA, CPG, JWH, BS), pp. 382–395.
SAT-2005-WeiS #approach
A New Approach to Model Counting (WW, BS), pp. 324–339.
SAT-2004-JiaMS #satisfiability
From Spin Glasses to Hard Satisfiable Formulas (HJ, CM, BS), pp. 12–19.
SAT-J-2004-JiaMS05 #satisfiability
From Spin Glasses to Hard Satisfiable Formulas (HJ, CM, BS), pp. 199–210.
KDD-2003-HopcroftKKS #community #network #scalability
Natural communities in large linked networks (JEH, OK, BK, BS), pp. 541–546.
SAT-2001-HorvitzRGKSC #approach #problem
A Bayesian Approach to Tackling Hard Computational Problems (EH, YR, CPG, HAK, BS, DMC), pp. 376–391.
SAT-2001-KautzRAGSS #problem #satisfiability
Balance and Filtering in Structured Satisfiable Problems (HAK, YR, DA, CPG, BS, MES), pp. 2–18.
SAT-2001-KautzS #named
Preface: Volume 9 (HAK, BS), p. 1.
ICML-2000-HuangSK #constraints #declarative #learning
Learning Declarative Control Rules for Constraint-BAsed Planning (YCH, BS, HAK), pp. 415–422.
LICS-2000-Selman #challenge #problem #satisfiability #testing
Satisfiability Testing: Recent Developments and Challenge Problems (BS), p. 178.
KR-1996-KautzMS #encoding #logic
Encoding Plans in Propositional Logic (HAK, DAM, BS), pp. 374–384.
Near-Optimal Plans, Tractability, and Reactivity (BS), pp. 521–529.
KR-1989-KautzS #logic #problem
Hard Problems for Simple Default Logics (HAK, BS), pp. 189–197.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.