Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68210DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325865FDOQ5325865

Authors: Ashish Sabharwal, Paul Beame, Henry Kautz 

Publication date: 24 July 2009

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

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

Recommendations

• scientific article; zbMATH DE number 2243370
• scientific article; zbMATH DE number 1931822
• Learning the dynamics of embedded clauses
• Structure learning of probabilistic logic programs by searching the clause space
• Using Community Structure to Detect Relevant Learnt Clauses
• The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
• Encoding Redundancy for Satisfaction-Driven Clause Learning
• Logic Programming and Nonmonotonic Reasoning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (7)

• Simple and Efficient Clause Subsumption with Feature Vector Indexing
• Hammering Mizar by Learning Clause Guidance (Short Paper).
• Title not available (Why is that?)
• Using Community Structure to Detect Relevant Learnt Clauses
• The state of SAT
• Clause size reduction with all-UIP learning
• BDD-guided clause generation

Uses Software

• SATO
• Chaff
• DIMACS
• Velev SAT Benchmarks

This page was built for publication: Theory and Applications of Satisfiability Testing

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