Reasoning With Weighted Ontologies

We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute its so-called boundary, with respect to a given property. We show that axiom pinpointing is the most general instance of this problem. Finally, we present three applications of the problem of boundary computation.

• Type: Journal
• Year: 2009
• Where: DLOG
• Authors: Rafael Peñaloza
• Keywords: Automated Reasoning, Boundary Computation, Distributive Lattice, DLOG 2009, So-called Boundary