Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective.

K. Subramani Piotr J. Wojciechowski

Published in: ISAIM (2020)

Keyphrases

cnf formula
max sat
propositional formulas
np complete
xml documents
database
neural network
artificial intelligence
relational databases
cost function
knowledge acquisition
constraint satisfaction
combinatorial optimization
branch and bound
sat problem