Learning a propagation complete formula

DOI10.1007/978-3-031-08011-1_15MaRDI QIDQ2170198zbMATH OpenOpenAlexFDO

Authors 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

consistency checkingempowering clauselearning algorithmpropagation-complete formulasatisfiability

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)

Recommendations

• Exact learning of formulas in parallel
• Learnability of quantified formulas.
• Understanding the potential of propagators
• On learning formulas in the limit and with assurance.
• Equations for message passing
• Algorithmic Learning Theory

Cites work

• Approximately propagation complete and conflict propagating constraint encodings
• Automatic generation of propagation complete SAT encodings
• Bounds on the size of PC and URC formulas
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
• Complexity issues related to propagation completeness
• DRMaxSAT with MaxHS: first contact
• Exclusive and essential sets of implicates of Boolean functions
• Generating SAT instances with community structure
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• Knowledge compilation with empowerment
• Learning conjunctions of Horn clauses
• Learning definite Horn formulas from closure queries
• Minimum Covers in Relational Database Model
• On CNF encodings of decision diagrams
• On tackling the limits of resolution in SAT solving
• On the power of clause-learning SAT solvers as resolution engines
• Strong duality in Horn minimization
• Theory and Applications of Satisfiability Testing

Cited in

(4)

• Propagation complete encodings of smooth DNNF theories
• Complexity issues related to propagation completeness
• Knowledge compilation with empowerment
• On CNF formulas irredundant with respect to unit clause propagation

Describes a project that uses

Uses Software

• MiniSat
• Glucose

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

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