LTL over EL Axioms

Stefan BorgwardtStefan Borgwardt, Veronika ThostVeronika Thost

Download

Stefan Borgwardt, Veronika Thost
LTL over EL Axioms
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, volume 15-07, 2015. LTCS-Report

Details
Bibtex

KurzfassungAbstract
We investigate a combination of EL-axioms with operators of the linear-temporal logic LTL. The complexity of deciding satisfiability is reduced when compared to ALC-LTL, but we also identify one setting where it remains the same. We additionally investigate the setting where GCIs are restricted to hold globally (at all time points), in which case the problem is PSpace-complete.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{BT2015,
  author      = {Stefan Borgwardt and Veronika Thost},
  title       = {LTL over {EL} Axioms},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer 
                 Science, Technische Universit{\"{a}}t Dresden},
  year        = {2015}
}