Ten challenges \textit{redux}: recent progress in propositional reasoning and search

DOI10.1007/B13743MaRDI QIDQ5897190zbMATH OpenOpenAlexFDO

Authors Henry Kautz, Bart Selman

Publication date 2 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13743

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 2243370
• Local Restarts
• On the limit of branching rules for hard random unsatisfiable 3-SAT
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• What we can learn from conflicts in propositional satisfiability

Cited in

(11)

• A two-phase algorithm for solving a class of hard satisfiability problems
• Equivalent literal propagation in the DLL procedure
• On the limit of branching rules for hard random unsatisfiable 3-SAT
• Equivalency reasoning to solve a class of hard SAT problems.
• Popularity-similarity random SAT formulas
• New models for generating hard random Boolean formulas and disjunctive logic programs
• A CSP search algorithm with responsibility sets and kernels
• Satsisfiability and systematicity
• Generating SAT instances with community structure
• Depth lower bounds in Stabbing Planes for combinatorial principles
• An efficient approach to solving random \(k\)-SAT problems

Describes a project that uses

Uses Software

• Chaff
• QingTing1
• Graphplan

This page was built for publication: Ten challenges \textit{redux}: recent progress in propositional reasoning and search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897190)