EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness.
Peter HertlingGisela KrommesPublished in: CoRR (2019)
Keyphrases
- temporal logic
- modal logic
- pspace complete
- coalition logic
- np complete
- satisfiability problem
- model checking
- classical logic
- order sorted
- epistemic logic
- phase transition
- proof theory
- predicate logic
- propositional dynamic logic
- modal operators
- propositional calculus
- nonmonotonic logics
- inference rules
- computational properties
- computational complexity
- logic programming
- expressive power
- conditional logic
- np hard
- higher order logic
- learning theory
- sequent calculi
- proof procedures
- proof theoretic
- information theoretic
- data quality
- search algorithm
- linear logic
- default logic
- intuitionistic logic
- logic programs
- worst case
- truth values
- set theory