Towards Statistical Reasoning in Description Logics over Finite Domains (Full Version)
نویسندگان
چکیده
We present a probabilistic extension of the description logic ALC for reasoning about statistical knowledge. We consider conditional statements over proportions of the domain and are interested in the probabilistic-logical consequences of these proportions. After introducing some general reasoning problems and analyzing their properties, we present first algorithms and complexity results for reasoning in some fragments of StatisticalALC.
منابع مشابه
Towards Statistical Reasoning in Description Logics over Finite Domains
We present a probabilistic extension of the description logic ALC for reasoning about statistical knowledge. We consider conditional statements over proportions of the domain and are interested in the probabilistic-logical consequences of these proportions. After introducing some general reasoning problems and analyzing their properties, we present first algorithms and complexity results for re...
متن کاملReasoning in description logics with variables: preliminary results regarding the EL logic
This paper studies the extension of description logics with variables ranging over infinite domains of concept names and role names. As a preliminary work, we consider more specifically the extension of the logic EL with variables and we investigate in this context two reasoning mechanisms, namely compliance (a kind of matching) and pattern containment. The main technical results are derived by...
متن کاملTowards Implementing Finite Model Reasoning in Description Logics
We describe our ongoing work that aims at understanding how one can develop a system that performs finite model reasoning in Description Logics. In particular we report on the preliminary results that we have obtained by encoding reasoning services in DLs as specifications for constraint programming solvers. We have used such an approach to reason with respect to finite models on UML class diag...
متن کاملTemporal Logics over Transitive States
We investigate the computational behaviour of ‘two-dimensional’ propositional temporal logics over (N, <) (with and without the next-time operator ) that are capable of reasoning about states with transitive relations. Such logics are known to be undecidable (even Π 1 complete) if the domains of states with those relations are assumed to be constant. Motivated by applications in the areas of te...
متن کاملDescription Logics with Fuzzy Concrete Domains
We present a fuzzy version of description logics with concrete domains. Main features are: (i) concept constructors are based on t-norm, t-conorm, negation and implication; (ii) concrete domains are fuzzy sets; (iii) fuzzy modifiers are allowed; and (iv) the reasoning algorithm is based on a mixture of completion rules and bounded mixed integer programming.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1706.03207 شماره
صفحات -
تاریخ انتشار 2017