37,829 Hits in 3.9 sec

The Complexity of Probabilistic EL

Jean Christoph Jung, Víctor Gutiérrez-Basulto, Carsten Lutz, Lutz Schröder
2011 International Workshop on Description Logics  
We analyze the complexity of subsumption in probabilistic variants of the description logic EL.  ...  One outcome is that any probability value except zero and one leads to intractability in the presence of general TBoxes, while this is not the case for classical TBoxes.  ...  Acknowledgements The present work was supported by the DFG project on probabilistic description logics (LU1417/1-1) and DAAD-CONACYT grant 206550.  ... 
dblp:conf/dlog/JungGLS11 fatcat:bbc7mv4rsbb3pmx4adgdupgkfy

Using Ontologies to Query Probabilistic Numerical Data [chapter]

Franz Baader, Patrick Koopmann, Anni-Yasmin Turhan
2017 Lecture Notes in Computer Science  
We determine the exact (data and combined) complexity of query answering in extensions of the well-known description logics EL and ALC with numerical comparison operators in this probabilistic setting.  ...  We consider ontology-based query answering in a setting where some of the data are numerical and of a probabilistic nature, such as data obtained from uncertain sensor readings.  ...  Complexity of Probabilistic Query Answering We study the complexity of probabilistic query answering for KBs with #·Padmissible pdfs.  ... 
doi:10.1007/978-3-319-66167-4_5 fatcat:k3kol6fsova63djhno3v75pqwa

Reasoning under Uncertainty with Log-Linear Description Logics

Mathias Niepert
2011 International Semantic Web Conference  
We compile a list of five requirements that we believe a probabilistic description logic should have to be useful in practice.  ...  The position paper provides a brief summary of log-linear description logics and their applications.  ...  The worst-case complexity should not exceed that of probabilistic graphical models such as Markov and Bayesian networks.  ... 
dblp:conf/semweb/Niepert11 fatcat:vytj4gawxfhpxpcbwo2b323iv4

Heuristic Ranking in Tightly Coupled Probabilistic Description Logics [article]

Thomas Lukasiewicz, Maria Vanina Martinez, Giorgio Orsi, Gerardo I. Simari
2012 arXiv   pre-print
In this paper, we present a probabilistic extension of the DL EL++ (which underlies the OWL2 EL profile) using Markov logic networks (MLNs) as probabilistic semantics.  ...  We show that, even though the tightly coupled nature of our language means that many basic operations are data-intractable, we can leverage a sublanguage of MLNs that allows to rank the atomic consequences  ...  In the probabilistic description logics literature, the most closely related work is that of Prob-EL [15, 10] , a probabilistic extension to EL that belongs to a family of probabilistic DLs derived in  ... 
arXiv:1210.4894v1 fatcat:jq2itwcfmvcnrizskdvgf5cvmm

Ontology-Mediated Query Answering for Probabilistic Temporal Data with EL Ontologies

Patrick Koopmann
2018 Deutsche Jahrestagung für Künstliche Intelligenz  
Especially in the field of stream reasoning, there is an increased interest in reasoning about temporal data in order to detect situations of interest or complex events.  ...  queries using this query language together with ontologies formulated in the description logic EL.  ...  An EL axiom is of the form C 1 ı C 2 , where C 1 and C 2 are EL concepts. An EL TBox is a set of EL axioms.  ... 
dblp:conf/ki/Koopmann18 fatcat:mkav2hcvmnhyjjfm4e6pb3s2cu

Ontology-Based Query Answering for Probabilistic Temporal Data

Patrick Koopmann
While in some cases, combining the temporal and the probabilistic dimension in such a way comes at the cost of increased complexity, we also determine cases for which this increase can be avoided.  ...  We analyse the complexities of evaluating queries in this language in various settings.  ...  Acknowledgements This work is supported by the German Research Foundation (DFG) within the Collaborative Research Center SFB 912 HAEC.  ... 
doi:10.1609/aaai.v33i01.33012903 fatcat:t2yis3dzkfe5nmcwk72okiai5q

Probabilistic setting of information-based complexity

H Woźniakowski
1986 Journal of Complexity  
We study the probabilistic (E, b)-complexity for linear problems equipped with Gaussian measures.  ...  The probabilistic (E, S)-complexity, comp@'(e, 6), is understood as the minimal cost required to compute approximations with error at most e on a set of measure at least 1 -6.  ...  to the average El-complexity with cl = e/m.  ... 
doi:10.1016/0885-064x(86)90005-1 fatcat:2zjaem7afjbvzk6k725xanhweu

Maybe Eventually? Towards Combining Temporal and Probabilistic Description Logics and Queries

Patrick Koopmann
2019 International Workshop on Description Logics  
We first show some complexity results for the setting in which either only temporal operators or only probabilistic operators may be used, both in the ontology and in the query, and then show a 2Exp-Space  ...  lower bound for the setting in which both types of operators can be used together.  ...  Since satisfiability of Prob-ALC is still in ExpTime [19] , the only known complexity lower bounds stem from the complexity of Boolean query entailment.  ... 
dblp:conf/dlog/Koopmann19 fatcat:i2ynk6cvsvfozldzshfo7nt7g4

Analyzing incomplete biological pathways using network motifs

Maya El Dayeh, Michael Hahsler
2012 Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12  
Probabilistic PPI Networks Pathway Completion Problem probabilistic PPI network and a protein complex: -Uncover a list of candidate proteins from the network ranked according to degree of membership  ...  -Advances in Bioinformatics 2009 [11] Given a probabilistic PPI network and a protein complex: -Uncover a list of candidate proteins from the network ranked according to degree of membership = PROXIMITY  ...  . • ConfidentNet has 5,552 proteins and 235,222 probabilistic interactions. • Handle MIMs and SIMs • Algorithm Accuracy (leave-one-out cross validation)  ... 
doi:10.1145/2245276.2231991 dblp:conf/sac/DayehH12 fatcat:jcgwu25sozd43lectrhu6rezzq

A Non-isotropic Probabilistic Take on Proxy-based Deep Metric Learning [article]

Michael Kirchhof, Karsten Roth, Zeynep Akata, Enkelejda Kasneci
2022 arXiv   pre-print
Each framework choice is motivated by a set of ablational studies, which showcase beneficial properties of our probabilistic approach to proxy-based DML, such as uncertainty-awareness, better-behaved gradients  ...  from a more probabilistic treatment.  ...  For the remainder of this work, we use EL-nivMF for the standalone probabilistic extension of ProxyNCA (Eq. 6), and P AN C+EL-nivMF for the probabilistically regularized ProxyAnchor (Eq. 7).  ... 
arXiv:2207.03784v1 fatcat:upfhvi5p65bnxhu4hbamuki2ca

On the Efficient Evaluation of Probabilistic Similarity Functions for Image Retrieval

N. Vasconcelos
2004 IEEE Transactions on Information Theory  
However, this occurs at the cost of a significant increase in computational complexity.  ...  In both cases, the new solutions have closed-form and computational complexity equivalent to that of standard retrieval approaches.  ...  Probabilistic Models While the complexity of (1) is linear in the cardinality of the set of query vectors , the complexities of both (2) and (3) are only functions on the number of parameters in and .  ... 
doi:10.1109/tit.2004.830760 fatcat:zrrliifd4bf4vhqspjgl5xvgzy

Making Decisions over Contextual Ontologies

Erman Acar, Rafael Peñaloza, Livia Predoiu
2019 International Workshop on Description Logics  
This is achieved through a combination of the light-weight DL EL and influence diagrams, a graphical model for representing decision situations, and their potential costs, under uncertainty.  ...  In this paper, we consider an extension of those formalisms that allows an agent to influence the choice of the context and minimise its subjective cost.  ...  To conclude, we note that the choice of EL as a logical formalism is motivated by its polynomial-time reasoning problems, which allow us to understand complexity issues better.  ... 
dblp:conf/dlog/AcarPP19 fatcat:56hzgfdwubha3flwh4p6k4nrlu

On relativized exponential and probabilistic complexity classes

Hans Heller
1986 Information and Control  
An oracle X is constructed such that the exponential complexity class A~ r,x equals the probabilistic class R(R(X)).  ...  The result shows possible inclusion relations for nonrelativized complexity classes and points out that certain results about probabilistic complexity classes and about polynomial size circuits cannot  ...  Probabilistic Complexity Classes In this section we will see which inclusion relations we can get for probabilistic complexity classes from Theorem 1.  ... 
doi:10.1016/s0019-9958(86)80012-2 fatcat:fo3u5bsczvhudlvodhplvub3ya

Deterministic Versus Probabilistic Volcano Monitoring: Not "or" But "and" [chapter]

D. Rouwet, R. Constantinescu, L. Sandri
2017 Advances in Volcanology  
Such reasoning ignores the complexity of volcanic processes and the fact that every scenario has a probability to occur.  ...  Nevertheless, probabilistic hazard assessment is often misunderstood as not all of the researchers involved have backgrounds in such matters. A probabilistic method cannot stand-alone  ...  The combination of social implications and forecasting future behaviour of complex natural systems makes volcanology a rather unique but "tricky business".  ... 
doi:10.1007/11157_2017_8 fatcat:3sturyha4bejbksi2klnfgfuye

El Niño- or La Niña-like climate change?

Matthew Collins
2004 Climate Dynamics  
linear trends from 1% experiment SAT, MSLP, precip coefficients are trends expressed in terms of the pattern of ENSO variability SAT of one means a SAT trend of one model standard El Niño event/century  ...  Standard El Niño EventNormalized EOF to determine patterns of ENSO variabilitySAT, MSLP, precip Control -Spatial PatternsControl -Surface Air TemperatureProbabilistic Predictions for ChangeDe-seasonalized  ...  Probabilistic Prediction  ... 
doi:10.1007/s00382-004-0478-x fatcat:wbdlfowbpzdpjjzwzzj3vymfke
« Previous Showing results 1 — 15 out of 37,829 results