Graph Pruning for Enumeration of Minimal Unsatisfiable Subsets.
Panagiotis LymperopoulosLiping LiuPublished in: AISTATS (2024)
Keyphrases
- search space
- unsatisfiable cores
- graph representation
- vertex set
- graph theory
- graph partitioning
- sat solvers
- minimal subsets
- graph model
- weighted graph
- random walk
- pruning method
- bipartite graph
- graph structure
- graph theoretic
- spanning tree
- exhaustive search
- dependency graph
- maximal clique enumeration
- directed graph
- search algorithm
- graph databases
- decision trees
- connected components
- graph data
- structured data
- orders of magnitude
- boolean satisfiability
- graph based algorithm
- dynamic programming
- pairwise
- optimal solution