Graph Pruning for Enumeration of Minimal Unsatisfiable Subsets.
Panagiotis LymperopoulosLiping LiuPublished in: CoRR (2024)
Keyphrases
- search space
- unsatisfiable cores
- minimal subsets
- directed graph
- pruning method
- graph representation
- structured data
- graph theory
- sat solvers
- random walk
- vertex set
- weighted graph
- exhaustive search
- graph mining
- graph model
- phase transition
- max sat
- connected components
- maximal clique enumeration
- bipartite graph
- orders of magnitude
- effective pruning
- tree pruning
- hidden structure
- branch and bound
- pruning methods
- graph matching
- dependency graph
- maximal cliques
- pruning algorithm
- graph construction
- xpath queries