A Linear Time Algorithm for Computing #2SAT for Outerplanar 2-CNF Formulas.
Marco A. López MedinaJosé Raymundo Marcial-RomeroGuillermo De Ita LunaYolanda MoyaoPublished in: MCPR (2018)
Keyphrases
- cnf formula
- sat problem
- max sat
- np complete
- graph mining
- structured data
- graph patterns
- davis putnam
- conjunctive normal form
- sat solvers
- graph databases
- propositional formulas
- maximal frequent
- propositional satisfiability
- planar graphs
- subgraph mining
- graph isomorphism
- satisfiability problem
- search algorithm
- randomly generated
- propositional logic
- decision problems
- expert systems
- lower bound
- database systems