B and D Are Enough to Make the Halpern-Shoham Logic Undecidable.
Jerzy MarcinkowskiJakub MichaliszynEmanuel KieronskiPublished in: ICALP (2) (2010)
Keyphrases
- temporal logic
- modal logic
- formal theory
- modal operators
- predicate logic
- model checking
- classical logic
- sufficient conditions
- belief update
- reasoning about actions
- multi valued
- multi agent learning
- decision procedures
- computational properties
- logic programming
- asynchronous circuits
- logical framework
- causal models
- inference rules
- satisfiability problem
- belief revision
- epistemic logic
- np complete
- automated reasoning
- data sets
- probability theory
- datalog programs
- nonmonotonic logics
- cooperative