Variant-Based Decidable Satisfiability in Initial Algebras with Predicates.

Raúl Gutiérrez José Meseguer

Published in: LOPSTR (2017)

Keyphrases

datalog programs
satisfiability problem
function symbols
computational complexity
np complete
first order logic
phase transition
lower bound
user defined
temporal reasoning
propositional logic
data complexity
decision procedures
symmetry breaking
relation algebra
automata theoretic