All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete.
Tadeusz LitakFrank WolterPublished in: Stud Logica (2005)
Keyphrases
- conp complete
- np complete
- expressive power
- data complexity
- data exchange
- decision problems
- conjunctive queries
- modal logic
- worst case
- complexity theoretic
- decision procedures
- satisfiability problem
- inference rules
- pspace complete
- combined complexity
- np hard
- inductive inference
- integrity constraints
- transitive closure
- first order logic
- schema mappings
- data mining
- lower complexity
- simple examples
- data management
- tuple generating dependencies