Automata Can Show PSpace Results for Description Logics
Testo completo
Documenti correlati
In that case, we could say that the external control, and in particular the accounting control entrusted to the external auditor, should not be mandatory, but it should be quite
In this section we recall some features of our model, including a basic renewal theory representation, originally proven in [3], and we derive some new
Ow- ing to this observation, it is common to restrict reasoning in fuzzy DLs with G¨odel semantics to the finitely many truth values occurring in the ontology (Bobillo et al..
Peñaloza, Are fuzzy description logics with general concept inclusion axioms decidable?, in: Proceedings of the 2011 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE’11),
It was recently shown that in the logic G-IALC under witnessed model semantics, all standard reasoning problems can be solved in ex- ponential time, matching the complexity of
Since our proofs mainly rely on various properties of Ramanujan’s theta functions and dissections of certain q-products, we end this section by defining a t-dissection and
There is a characterization of outerplanar graphs that says a graph is outerplanar if and only if it does not contain a subdivision of the complete graph K 4 or the complete
Nochetto, Optimal L ∞ -error estimates for nonconforming and mixed finite element methods of lowest order, Numer.. Nochetto, On L ∞ - accuracy of mixed finite element methods for