Keyword

propositional satisfiability

Description: A problem in logic and computer science that asks whether some assignment of truth values makes a propositional formula true.

Primary topic: Constraint Satisfaction and Optimization (48%)

Wikidata ID: wiki/Q875276

OpenAlex ID: keywords/propositional-satisfiability

Sequential Model-Based Optimization for General Algorithm Configuration

2011 · Frank Hutter, Holger H. Hoos, et al. · Lecture notes in computer science · 2,358

Symbolic Model Checking without BDDs

1999 · Armin Biere, Alessandro Cimatti, et al. · Lecture notes in computer science · 2,150

GRASP: a search algorithm for propositional satisfiability

1999 · J.P. Marques-Silva, K.A. Sakallah · IEEE Transactions on Computers · 1,375

A new method for solving hard satisfiability problems

1992 · Bart Selman, Hector J. Levesque, et al. · 1,175

Satisfiability Modulo Theories

2018 · Clark Barrett, Cesare Tinelli · Springer eBooks · 1,122

Bounded Model Checking

2003 · Armin Biere, Alessandro Cimatti, et al. · Advances in computers · 951

Solving SAT and SAT Modulo Theories

2006 · Robert Nieuwenhuis, Albert Oliveras, et al. · Journal of the ACM · 783

On the hardness of approximate reasoning

1996 · Dan Roth · Artificial Intelligence · 611

Logic-based Benders decomposition

2003 · J.N. Hooker, G. Ottosson · Mathematical Programming · 595

Using CSP look-back techniques to solve real-world SAT instances

1997 · Roberto J. Bayardo, Robert Schrag · 585

Bucket elimination: A unifying framework for reasoning

1999 · Rina Dechter · Artificial Intelligence · 583

PDF

Symbolic Model Checking without BDDs

1999 · Armin Biere, Alessandro Cimatti, et al. · 537

Automated Algorithm Selection: Survey and Perspectives

2018 · Pascal Kerschke, Holger H. Hoos, et al. · Evolutionary Computation · 435

Algorithm runtime prediction: Methods & evaluation

2013 · Frank Hutter, Lin Xu, et al. · Artificial Intelligence · 395

PDF

Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

2000 · Carla P. Gomes, Bart Selman, et al. · Journal of Automated Reasoning · 386

MBO: marriage in honey bees optimization-a Haplometrosis polygynous swarming approach

2002 · H.A. Abbass · Congress on Evolutionary Computation · 380

Semantic matching

2003 · FAUSTO GIUNCHIGLIA, PAVEL SHVAIKO · The Knowledge Engineering Review · 321

Domain-independent extensions to GSAT: solving large structured satisfiability problems

1993 · Bart Selman, Henry Kautz · 291

The Consistent Labeling Problem: Part I

1979 · Robert M. Haralick, Linda G. Shapiro · IEEE Transactions on Pattern Analysis and Machine Intelligence · 285

Propositional semantics for disjunctive logic programs

1994 · Rachel Ben-Eliyahu, Rina Dechter · Annals of Mathematics and Artificial Intelligence · 274

PDF

Solving propositional satisfiability problems

1990 · Robert G. Jeroslow, Jinchang Wang · Annals of Mathematics and Artificial Intelligence · 270

Improvements to propositional satisfiability search algorithms

1995 · Jon Freeman · 265

Resolve and Expand

2005 · Armin Biere · Lecture notes in computer science · 243

SAT v CSP

2000 · Toby Walsh · Lecture notes in computer science · 238

A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search

2002 · Evgeny Dantsin, Andreas Goerdt, et al. · Theoretical Computer Science · 229

PDF

Works count: 1,362

Citation count: 31,950