## IOS Press An Infrastructure for Probabilistic Reasoning with Web Ontologies

### Citations

2917 | Maintaining Knowledge about Temporal Intervals
- Allen
- 1983
(Show Context)
Citation Context ...extend the set of constraints in order to detect inconsistencies. For this purpose, the reasoning system incorporates the temporal predicates (e.g. before, during, . . . ) of Allen’s interval algebra =-=[1]-=- that can be used to express such constraints. The proposed approach is implemented by the reasoner T-RDFS-LOG.5 5http://executor.informatik.uni-mannheim. de/systems/t-rdfs-log/ 5. Applications In [31... |

643 |
RDF Vocabulary Description Language 1.0
- Brickley, Guha
(Show Context)
Citation Context ...e RDF statements. In order to attach weights to RDF statements, we rely in our implementation on the concept of reification and annotation properties. Our system relies on the RDF(S) entailment rules =-=[6]-=- as a standard rule set. Using the predicate triple(s, p, o), we define the entailment relation |=RDFS by mapping the RDF(S) entailment rules to first-order formulas. For instance, we state the rule 4... |

465 | Pushing the el envelope
- Brandt
- 2005
(Show Context)
Citation Context ...ept. Note that axioms involving complex concept descriptions can be transformed into a normalized representation by applying a finite set of normalization rules introducing new concept and role names =-=[3]-=-. The translation of CD and CU results in unweighted (hard) and weighted first order formulas. The hard formulas are used, together with the completion rules described in the following paragraph, to d... |

249 |
Logical Foundations of Artificial Intelligence
- Genesereth, Nils
- 1987
(Show Context)
Citation Context ...eriori (MAP) inference. 3.1. Markov Logic Markov logic is a first-order template language combining first-order logic with log-linear graphical models. We first review function-free first-order logic =-=[14]-=-. Here, a term is either a constant or a variable. An atom p(t1, ..., tn) consists of a predicate p/n of arity n followed by n terms ti. A literal ` is an atom a or its negation ¬a. A clause is a disj... |

146 | ProbLog: A probabilistic Prolog and its application in link discovery
- Raedt, Kimmig, et al.
- 2007
(Show Context)
Citation Context ...ilities of the resulting statements. The corresponding methods have been implemented in the PRONTO system [22]. Riguzzi and others adapt the semantics of probabilistic logic programs as introduced in =-=[11]-=- to description logics defining the DISPONTE approach for probabilistic ontologies. DISPONTE can answer queries over probabilistic ontologies using binary decision diagrams. The corresponding methods ... |

132 | Managing uncertainty and vagueness in Description Logics for the Semantic Web
- Lukasiewicz, Straccia
(Show Context)
Citation Context ...ards statistical inference. In this paper, we present a software infrastructure that implements the second way - an extension of logical reasoning in Semantic Web languages with statistical inference =-=[27]-=-. In particular, we focus on the task of computing the most probable consistent ontology from a set of possibly inconsistent axioms some of which are not certain and have a weight attached that can be... |

117 |
Rdf semantics
- Hayes
- 2004
(Show Context)
Citation Context ...g.4 4.3. The RDF Schema Interface While the OWL-EL interface was mainly designed for terminological reasoning, the focus of the RDFS interface is rather on reasoning tasks related to the A-Box. A RDF =-=[18]-=- knowledge base contains statements of the form (subject, predicate, object). Such statements can be seen as the only axiom type present in an RDF Schema knowledge base. Thus, we only need to define o... |

89 |
Introducing time into rdf
- Gutierrez, Hurtado, et al.
- 2007
(Show Context)
Citation Context ...e to assign a temporal interval, which consists of a start point and end point, resulting in statements of the form 〈triple(s, p, o)[start , end ]〉. The interval expresses the validity time of a fact =-=[16,17]-=-. Considering the temporal relations of events, it is possible to extend the set of constraints in order to detect inconsistencies. For this purpose, the reasoning system incorporates the temporal pre... |

76 | Consequence-driven reasoning for horn SHIQ ontologies
- Kazakov
- 2009
(Show Context)
Citation Context ...om types and whose entailment relation can be modeled using Markov logic rules. In Semantic Web research such languages have been studied in connection with the notion of consequence-driven reasoning =-=[21]-=-, providing us with a set of possible languages we can extend towards probabilistic reasoning. In the following, we discuss two of these languages that we have implemented in our infrastructure. 4.2. ... |

75 |
Expressive probabilistic description logics
- Lukasiewicz
- 2008
(Show Context)
Citation Context ...th notions of probability using different approaches including non-monotonic reasoning, probabilistic logic programming, Bayesian networks and Markov logic. The probabilistic description logic PSROIQ =-=[26]-=- is an expressive description logic that combines conditional probabilities about concepts and statements expressing uncertain knowledge about instances. The logic supports probabilistic knowledge bas... |

72 |
Dbpedia–a large-scale, multilingual knowledge base extracted from wikipedia. Semantic Web
- Lehmann, Isele, et al.
- 2014
(Show Context)
Citation Context ... able to cleanse a knowledge base by removing the statements that do not belong to the MAP state. In [19] we have evaluated this application scenario in an artificial setting that is based on DBPedia =-=[25]-=- data. Therefore, we extracted over 150k facts (RDF triples) describing entities of the domain of academics. For this domain, we define a set of specific constraints that are used to detect and to res... |

70 |
Improving the accuracy and efficiency of MAP inference for Markov logic
- Riedel
- 2008
(Show Context)
Citation Context ...here the novel cutting plane aggregation approach (CPA) is tightly integrated with cutting plane inference (CPI) which is a meta-algorithm operating between the grounding algorithm and the ILP solver =-=[32]-=-. Instead of immediately adding one constraint for each ground formula to the ILP formulation, the ILP is initially formulated so as to enforce the given evidence to hold in any solu2www.pylonsproject... |

66 | Logmap: Logic-based and scalable ontology matching
- Jiménez-Ruiz, Grau
(Show Context)
Citation Context ...l systems and algorithms have been developed to deal with the problem of debugging incoherent alignments. We present experiments comparing our generic approach to two of these system which are LogMap =-=[20]-=- and Alcomo [28]. LogMap is a matching system that consists beside other components of an algorithm for generating (nearly) coherent alignments. Huber et al. / An Infrastructure for Probabilistic Reas... |

64 | MEBN: A language for first-order Bayesian knowledge bases
- Laskey
(Show Context)
Citation Context ...rly aims at computing probabilistic query answers which corresponds to marginal inference rather than MAP inference. PR-OWL [8,9] is a language based on the multi-entity Bayesian network (MEBN) logic =-=[24]-=-. MEBNs specify a first-order language for modeling probabilistic knowledge bases as parametrized fragments of Bayesian networks. PROWL adds new elements to the OWL standard which enables to create ME... |

57 | Ontologies and databases: The DL-Lite approach
- Calvanese, Giacomo, et al.
- 2009
(Show Context)
Citation Context ...n. While in particular, the development of light-weight ontology languages and the use of database techniques for ontology-based data access has given another boost to the use of logical models (e.g. =-=[7]-=-), it has also become more and more clear that logical reasoning alone is not enough for many Semantic Web applications. In particular, use cases that require a combined processing of structured and u... |

48 | Temporal RDF
- Gutiérrez, Hurtado, et al.
- 2005
(Show Context)
Citation Context ...e to assign a temporal interval, which consists of a start point and end point, resulting in statements of the form 〈triple(s, p, o)[start , end ]〉. The interval expresses the validity time of a fact =-=[16,17]-=-. Considering the temporal relations of events, it is possible to extend the set of constraints in order to detect inconsistencies. For this purpose, the reasoning system incorporates the temporal pre... |

43 |
Bayesian semantics for the Semantic Web
- Costa
- 2005
(Show Context)
Citation Context ...have been integrated into the Pellet description logic system. DISPONTE clearly aims at computing probabilistic query answers which corresponds to marginal inference rather than MAP inference. PR-OWL =-=[8,9]-=- is a language based on the multi-entity Bayesian network (MEBN) logic [24]. MEBNs specify a first-order language for modeling probabilistic knowledge bases as parametrized fragments of Bayesian netwo... |

38 |
PR-OWL: A framework for probabilistic ontologies
- Costa, Laskey
- 2006
(Show Context)
Citation Context ...have been integrated into the Pellet description logic system. DISPONTE clearly aims at computing probabilistic query answers which corresponds to marginal inference rather than MAP inference. PR-OWL =-=[8,9]-=- is a language based on the multi-entity Bayesian network (MEBN) logic [24]. MEBNs specify a first-order language for modeling probabilistic knowledge bases as parametrized fragments of Bayesian netwo... |

13 | RockIt: Exploiting parallelism and symmetry for map inference in statistical relational models
- Noessner, Niepert, et al.
- 2013
(Show Context)
Citation Context ...r (reasoning) system. In fact, it is possible to add any system that is compatible with the Linux distribution Debian. 3. The ROCKIT Engine The foundation of our system is the ROCKIT reasoning engine =-=[30]-=-, a state of the art reasoning engine for Markov logic networks. ROCKIT is specialized on performing maximum a posteriori (MAP) inference. Each MAP query corresponds to an optimization problem with li... |

11 | Log-linear description logics
- Niepert, Noessner, et al.
- 2011
(Show Context)
Citation Context ...ear Logics Log-linear (description) logics have been introduced by Niepert and others as a framework for encoding non-trivial logics into probabilistic reasoning using the notion of log-linear models =-=[29]-=-. A log-linear logic knowledge base KB consists of a deterministic knowledge base CD and an uncertain knowledge base CU. CD contains axioms in some logic L that supports a valid entailment relation |=... |

9 |
A distribution semantics for probabilistic ontologies
- Bellodi, Lamma, et al.
- 2011
(Show Context)
Citation Context ...approach for probabilistic ontologies. DISPONTE can answer queries over probabilistic ontologies using binary decision diagrams. The corresponding methods have been implemented in the BUNDLE reasoner =-=[33,5]-=-. Both reasoners have been integrated into the Pellet description logic system. DISPONTE clearly aims at computing probabilistic query answers which corresponds to marginal inference rather than MAP i... |

9 |
BUNDLE: A reasoner for probabilistic ontologies
- Riguzzi, Bellodi, et al.
(Show Context)
Citation Context ...approach for probabilistic ontologies. DISPONTE can answer queries over probabilistic ontologies using binary decision diagrams. The corresponding methods have been implemented in the BUNDLE reasoner =-=[33,5]-=-. Both reasoners have been integrated into the Pellet description logic system. DISPONTE clearly aims at computing probabilistic query answers which corresponds to marginal inference rather than MAP i... |

8 | Timeaware reasoning in uncertain knowledge bases
- Wang, Yahya, et al.
- 2010
(Show Context)
Citation Context ...ible with a reasoner that supports DL-safe rules in order to detect inconsistencies. However, their system can only detect if a knowledge base is consistent but cannot resolve the existing conflicts. =-=[34,13,12]-=- proposed different approaches to resolve temporal conflicts at query time. In particular, they define temporal constraint as Datalog rules. However, these approaches do not incorporate terminological... |

7 | A temporal-probabilistic database model for information extraction
- Dylla, Miliaraki, et al.
(Show Context)
Citation Context ...ible with a reasoner that supports DL-safe rules in order to detect inconsistencies. However, their system can only detect if a knowledge base is consistent but cannot resolve the existing conflicts. =-=[34,13,12]-=- proposed different approaches to resolve temporal conflicts at query time. In particular, they define temporal constraint as Datalog rules. However, these approaches do not incorporate terminological... |

4 |
Valentina Ivanova, Ernesto Jimenez-Ruiz11, Andreas Oskar Kempf
- Grau, Dragisic, et al.
- 2013
(Show Context)
Citation Context ...hat differ with respect to completeness and runtime efficiency. We have used the testcases of the well known OAEI conference track together with the alignments submitted by the OAEI 2013 participants =-=[15]-=-. We merged these alignments (details can be found in [31]) and conducted experiments for different thresholds. For low thresholds the input alignments were large and highly incoherent while high thre... |

3 | Resolving temporal conflicts in inconsistent rdf knowledge bases
- Dylla, Sozio, et al.
- 2011
(Show Context)
Citation Context ...ible with a reasoner that supports DL-safe rules in order to detect inconsistencies. However, their system can only detect if a knowledge base is consistent but cannot resolve the existing conflicts. =-=[34,13,12]-=- proposed different approaches to resolve temporal conflicts at query time. In particular, they define temporal constraint as Datalog rules. However, these approaches do not incorporate terminological... |

2 |
Applying markov logic for debugging probabilistic temporal knowledge bases
- Huber, Meilicke, et al.
- 2014
(Show Context)
Citation Context ...FS-LOG.5 5http://executor.informatik.uni-mannheim. de/systems/t-rdfs-log/ 5. Applications In [31] we have applied the OWL-EL interface to improve automatically generated ontology alignments, while in =-=[19]-=- we have shown how to use the methods available via the RDF schema interface to debug a probabilistic temporal knowledge base. Within the following two sections we summarize these application scenario... |

2 |
Practical reasoning in probabilistic description logic
- Klinov
- 2011
(Show Context)
Citation Context ...cific assertions over less specific ones and calculating upper and lower bounds for the probabilities of the resulting statements. The corresponding methods have been implemented in the PRONTO system =-=[22]-=-. Riguzzi and others adapt the semantics of probabilistic logic programs as introduced in [11] to description logics defining the DISPONTE approach for probabilistic ontologies. DISPONTE can answer qu... |

1 |
Sotiris Batsakis, and Euripides GM Petrakis. Chronos: A reasoning engine for qualitative temporal information
- Anagnostopoulos
(Show Context)
Citation Context ...2 and f3. Hence, f2 has to be removed in order to obtain a consistent knowledge base despite having the highest weight of all facts. Different approaches have been proposed to solve such problems. In =-=[4,2]-=- OWL 2.0 is extended in order to enable temporal reasoning for supporting temporal queries. The authors define SWRL rules that are compatible with a reasoner that supports DL-safe rules in order to de... |

1 |
Kostas Stravoskoufos, and Euripides GM Petrakis. Temporal reasoning for supporting temporal queries in owl 2.0
- Batsakis
- 2011
(Show Context)
Citation Context ...2 and f3. Hence, f2 has to be removed in order to obtain a consistent knowledge base despite having the highest weight of all facts. Different approaches have been proposed to solve such problems. In =-=[4,2]-=- OWL 2.0 is extended in order to enable temporal reasoning for supporting temporal queries. The authors define SWRL rules that are compatible with a reasoner that supports DL-safe rules in order to de... |

1 |
Grobelnik, Agnieszka Lawrynowicz, and Vojtech Svatek. Inductive reasoning and machine learning for the semantic web
- d’Amato, Fanizzi, et al.
(Show Context)
Citation Context ...antic) Web has focused on methods that combine structured representations with statistical inference. One possible approach is the extension of machine learning methods to complex structural features =-=[10]-=-, the other is to extend logical reasoning in Semantic Web languages towards statistical inference. In this paper, we present a software infrastructure that implements the second way - an extension of... |

1 |
Alignment incoherence in ontology match12 Huber et al. / An Infrastructure for Probabilistic Reasoning with Web Ontologies ing
- Meilicke
- 2011
(Show Context)
Citation Context ...gorithms have been developed to deal with the problem of debugging incoherent alignments. We present experiments comparing our generic approach to two of these system which are LogMap [20] and Alcomo =-=[28]-=-. LogMap is a matching system that consists beside other components of an algorithm for generating (nearly) coherent alignments. Huber et al. / An Infrastructure for Probabilistic Reasoning with Web O... |

1 | Completeness and optimality in ontology alignment debugging
- Noessner, Stuckenschmidt, et al.
- 2014
(Show Context)
Citation Context ...[1] that can be used to express such constraints. The proposed approach is implemented by the reasoner T-RDFS-LOG.5 5http://executor.informatik.uni-mannheim. de/systems/t-rdfs-log/ 5. Applications In =-=[31]-=- we have applied the OWL-EL interface to improve automatically generated ontology alignments, while in [19] we have shown how to use the methods available via the RDF schema interface to debug a proba... |