Unions of non-disjoint theories and combinations of satisfiability procedures.

Cesare Tinelli Christophe Ringeissen

Published in: Theor. Comput. Sci. (2003)

Keyphrases

satisfiability problem
propositional theories
propositional logic
computational complexity
pairwise
logic programs
phase transition
tree patterns
cognitive psychology
terminological reasoning
np complete
theoretical framework
quantified boolean formulas
search space
sat problem
satisfiability testing