Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic.
Przemyslaw Andrzej WalegaPublished in: ICLA (2017)
Keyphrases
- temporal logic
- automata theoretic
- computational complexity
- modal logic
- np hard
- model checking
- formal theory
- modal operators
- predicate logic
- horn logic
- np complete
- special case
- high computational complexity
- horn clauses
- satisfiability problem
- genetic algorithm ga
- classical logic
- decision problems
- inference rules
- propositional logic
- belief revision
- logic programming
- multi agent learning
- memory requirements
- belief update
- computationally efficient
- optimal solution
- proof theory
- belief change
- reasoning about actions
- computational properties
- logical framework
- multi valued
- causal models
- particle swarm optimization