Variant-Based Decidable Satisfiability in Initial Algebras with Predicates.

Raúl Gutiérrez José Meseguer

Published in: CoRR (2017)

Keyphrases

computational complexity
datalog programs
satisfiability problem
np complete
user defined
automata theoretic
symmetry breaking
function symbols
cnf formula
terminological reasoning