Learning a propagation complete formula

DOI10.1007/978-3-031-08011-1_15OpenAlexW4285137001MaRDI QIDQ2170198

Petr Kučera

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_15

zbMATH Keywords

learning algorithmsatisfiabilityconsistency checkingempowering clausepropagation-complete formula

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)

Uses Software

• MiniSat
• Glucose

Cites Work

• Unnamed Item
• Unnamed Item
• Generating SAT instances with community structure
• Learning definite Horn formulas from closure queries
• On the power of clause-learning SAT solvers as resolution engines
• Exclusive and essential sets of implicates of Boolean functions
• Learning conjunctions of Horn clauses
• Approximately propagation complete and conflict propagating constraint encodings
• Strong duality in Horn minimization
• On tackling the limits of resolution in SAT solving
• DRMaxSAT with MaxHS: first contact
• Complexity issues related to propagation completeness
• Automatic Generation of Propagation Complete SAT Encodings
• On CNF Encodings of Decision Diagrams
• Knowledge Compilation with Empowerment
• Minimum Covers in Relational Database Model
• Bounds on the size of PC and URC formulas
• Theory and Applications of Satisfiability Testing
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution

This page was built for publication: Learning a propagation complete formula