Model counting for #2SAT problem in outerplanar graphs.
Marco A. López MedinaJosé Raymundo Marcial-RomeroJosé A. HernándezGuillermo De ItaPublished in: LANMR (2018)
Keyphrases
- sat problem
- graph mining
- model counting
- graph patterns
- graph isomorphism
- graph databases
- propositional formulas
- frequent subgraphs
- planar graphs
- satisfiability problem
- np complete
- sat solvers
- max sat
- pattern mining
- constraint satisfaction problems
- phase transition
- graph data
- randomly generated
- knowledge compilation
- bounded treewidth
- sat instances
- structured data
- polynomial size
- propositional satisfiability
- np complete problems
- propositional logic
- stochastic local search
- decision problems
- relational databases
- query language
- orders of magnitude