Computational Complexity of a Core Fragment of Halpern-Shoham Logic.
Przemyslaw Andrzej WalegaPublished in: TIME (2018)
Keyphrases
- temporal logic
- automata theoretic
- computational complexity
- modal logic
- modal operators
- formal theory
- model checking
- predicate logic
- np complete
- storage requirements
- special case
- inference rules
- decision problems
- satisfiability problem
- low complexity
- belief revision
- logic programming
- epistemic logic
- sound and complete axiomatization
- reasoning about actions
- multi agent learning
- high computational complexity
- classical logic
- computational properties
- causal models
- situation calculus
- computationally efficient
- logic programs
- computational cost
- belief update
- relational databases
- reinforcement learning
- data sets