Finite Satisfiability of Unary Negation Fragment with Transitivity.
Daniel DanielskiEmanuel KieronskiPublished in: MFCS (2019)
Keyphrases
- satisfiability problem
- automata theoretic
- guarded fragment
- pairwise
- phase transition
- np complete
- logic programming
- propositional logic
- temporal logic
- logic programs
- computational complexity
- decision procedures
- model checking
- knowledge base
- finite number
- quantified boolean formulas
- containment of conjunctive queries
- search algorithm