Login / Signup
On Computing Maximal Subsets of Clauses that Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts.
Philippe Besnard
Éric Grégoire
Jean-Marie Lagniez
Published in:
AAAI (2015)
Keyphrases
</>
cnf formula
search space
propositional formulas
horn clauses
data sets
genetic algorithm
case study
relational databases
logic programs
np complete
phase transition
satisfiability problem