Finite Satisfiability of Unary Negation Fragment with Transitivity.

Daniel Danielski Emanuel Kieronski

Published in: CoRR (2018)

Keyphrases

automata theoretic
satisfiability problem
guarded fragment
pairwise
logic programs
finite number
temporal logic
terminological reasoning
deductive databases
propositional logic
logic programming
np complete
compositional semantics
phase transition
databases
computational complexity
search algorithm