Decidable and Undecidable Fragments of First-Order Branching Temporal Logics.
Ian M. HodkinsonFrank WolterMichael ZakharyaschevPublished in: LICS (2002)
Keyphrases
- satisfiability problem
- guarded fragment
- temporal logic
- mazurkiewicz traces
- model checking
- unions of conjunctive queries
- modal logic
- datalog programs
- computation tree logic
- linear temporal logic
- decision procedures
- np complete
- data exchange
- first order logic
- query answering
- concurrent systems
- automata theoretic
- phase transition
- query containment
- plan existence
- data complexity
- exptime complete
- temporal epistemic
- linear time temporal logic
- knowledge base
- description logics
- bounded model checking
- transition systems
- plan generation
- inference rules
- expressive power
- sufficient conditions
- knowledge representation