Bart Selman

From MaRDI portal
Revision as of 02:18, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Bart Selman to Bart Selman: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:545552

Available identifiers

zbMath Open selman.bartDBLPs/BartSelmanWikidataQ4865105 ScholiaQ4865105MaRDI QIDQ545552

List of research outcomes





PublicationDate of PublicationType
Hidden community detection on two-layer stochastic models: a theoretical perspective2022-12-22Paper
Generating hard satisfiability problems2022-09-22Paper
Critical behavior in the computational cost of satisfiability testing2022-09-22Paper
Support set selection for abductive and default reasoning2022-09-22Paper
DPLL: The Core of Modern Satisfiability Solvers2020-08-06Paper
Determining computational complexity from characteristic ‘phase transitions’2017-09-01Paper
https://portal.mardi4nfdi.de/entity/Q57404442016-07-26Paper
On the Erdős Discrepancy Problem2015-07-21Paper
Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability2013-08-05Paper
Critical Behavior in the Satisfiability of Random Boolean Expressions2011-11-28Paper
Leveraging belief propagation, backtrack search, and statistics for model counting2011-06-22Paper
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search2010-09-29Paper
Principles and Practice of Constraint Programming – CP 20032010-03-02Paper
Short XORs for Model Counting: From Theory to Practice2009-03-10Paper
Principles and Practice of Constraint Programming – CP 20042008-09-09Paper
Principles and Practice of Constraint Programming – CP 20042008-09-09Paper
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting2008-05-27Paper
Sensor networks and distributed CSP: communication, computation and complexity2007-10-23Paper
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning2007-10-11Paper
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency2007-09-04Paper
The state of SAT2007-08-23Paper
Regular random \(k\)-SAT: Properties of balanced formulas2007-01-24Paper
Statistical regimes across constrainedness regions2006-11-03Paper
Theory and Applications of Satisfiability Testing2005-12-16Paper
Theory and Applications of Satisfiability Testing2005-12-15Paper
https://portal.mardi4nfdi.de/entity/Q44756472004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44730322004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44608052004-03-29Paper
Horn approximations of empirical data2003-02-04Paper
Compute-intensive methods in artificial intelligence2002-06-27Paper
https://portal.mardi4nfdi.de/entity/Q27498532001-10-21Paper
https://portal.mardi4nfdi.de/entity/Q27415102001-09-24Paper
https://portal.mardi4nfdi.de/entity/Q27415402001-09-24Paper
Heavy-tailed phenomena in satisfiability and constraint satisfaction problems2001-09-03Paper
https://portal.mardi4nfdi.de/entity/Q27349362001-08-30Paper
Algorithm portfolios2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q47047991999-11-25Paper
https://portal.mardi4nfdi.de/entity/Q43757731998-03-02Paper
Knowledge compilation and theory approximation1998-01-21Paper
https://portal.mardi4nfdi.de/entity/Q56872711997-06-09Paper
The complexity of path-based defeasible inheritance1994-01-19Paper
Hard problems for simple default logics1992-06-28Paper
Model-preference default theories1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32005951989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34933271989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38305581989-01-01Paper
A special-purpose processor for the Monte Carlo simulation of Ising spin systems1983-01-01Paper

Research outcomes over time

This page was built for person: Bart Selman