Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
On the expressive power of description logics with cardinality constraints on finite and infinite sets
In recent work we have extended the description logic (DL) ALC\! Q by means of more
expressive number restrictions using numerical and set constraints stated in the quantifier …
expressive number restrictions using numerical and set constraints stated in the quantifier …
[HTML][HTML] One-variable logic meets Presburger arithmetic
B Bednarczyk - Theoretical Computer Science, 2020 - Elsevier
We consider the one-variable fragment of first-order logic extended with Presburger
constraints. The logic is designed in such a way that it subsumes the previously-known …
constraints. The logic is designed in such a way that it subsumes the previously-known …
Integrating reasoning services for description logics with cardinality constraints with numerical optimization techniques
F De Bortoli - 2023 - tud.qucosa.de
Abstract (EN) Recent research in the field of Description Logic (DL) investigated the
complexity of the satisfiability problem for description logics that are obtained by enriching …
complexity of the satisfiability problem for description logics that are obtained by enriching …
Consequence-based Algebraic Reasoning for SHOQ
N Zolfaghar Karahroodi - 2024 - spectrum.library.concordia.ca
Qualified Cardinality Restrictions (QCRs) and nominals are the two constructors in OWL 2
DL to apply numerical restrictions on domain concepts and relations. Utilizing these …
DL to apply numerical restrictions on domain concepts and relations. Utilizing these …
Quantitative logic reasoning
M Finger - Contradictions, from consistency to inconsistency, 2018 - Springer
In this paper we show several similarities among logic systems that deal simultaneously with
deductive and quantitative inference. We claim it is appropriate to call the tasks those …
deductive and quantitative inference. We claim it is appropriate to call the tasks those …
[PDF][PDF] Description logics that count, and what they can and cannot count
Simple counting quantifiers that can be used to compare the number of role successors of
an individual or the cardinality of a concept with a fixed natural number have been employed …
an individual or the cardinality of a concept with a fixed natural number have been employed …
On the Complexity and Expressiveness of Description Logics with Counting
F Baader, F De Bortoli - 2019 - tud.qucosa.de
Abstract (EN) Simple counting quantifiers that can be used to compare the number of role
successors of an individual or the cardinality of a concept with a fixed natural number have …
successors of an individual or the cardinality of a concept with a fixed natural number have …
[PDF][PDF] LTCS–Report
F Baader, S Borgwardt, B Morawska - 2007 - iccl.inf.tu-dresden.de
Abstract Unification in Description Logics (DLs) has been proposed as an inference service
that can, for example, be used to detect redundancies in ontologies. For the DL EL, which is …
that can, for example, be used to detect redundancies in ontologies. For the DL EL, which is …