An NP-complete fragment of fibring logic.
Yin WuMin JiangZhongqiang HuangFei ChaoChangle ZhouPublished in: Ann. Math. Artif. Intell. (2015)
Keyphrases
- np complete
- modal logic
- randomly generated
- np hard
- satisfiability problem
- constraint satisfaction problems
- logic programming
- conjunctive queries
- temporal logic
- computational complexity
- inference rules
- classical logic
- epistemic logic
- pspace complete
- modal operators
- np complete problems
- logical equivalence
- automata theoretic
- databases
- proof theory
- polynomial time complexity
- data complexity
- predicate logic