Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a translation of (one-way and two-way) alternating automata into description logics, thus reducing the emptiness problem for alternating automata to satisfiability of the target description logic. The latter problem can then be decided using highly optimised, tableau-based description logic reasoners. The translation is a step towards the understanding of the relationship beten automataand tableau-based decision procedures for description and modal logics. Moreover, it yields some by-products: (i) a program deciding the emptiness problem for alternating automata and thus the satisfiability problem for logics with automata-based decision procedures; and (ii) tight complexity bounds for the target description logic.
['Jan Hladik', 'Ulrike Sattler']
I am writing a research paper on a idea A translation of looping alternating automata into description logics
[{"from": "human", "value": "I am writing a research paper on a idea A translation of looping alternating automata into description logics"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a translation of (one-way and two-way) alternating automata into description logics, thus reducing the emptiness problem for alternating automata to satisfiability of the target description logic. The latter problem can then be decided using highly optimised, tableau-based description logic reasoners. The translation is a step towards the understanding of the relationship beten automataand tableau-based decision procedures for description and modal logics. Moreover, it yields some by-products: (i) a program deciding the emptiness problem for alternating automata and thus the satisfiability problem for logics with automata-based decision procedures; and (ii) tight complexity bounds for the target description logic."}]