Name
Abstract | ||
|---|---|---|
Description Logic programs (DL-programs) are a prominent approach for a loose coupling of rules and ontologies, which has become a topic of increased interest. When computing answer sets of a DL-program, special DL-atoms, which provide query interface to an ontology, are evaluated under a possibly changing input that gives a context for the evaluation. Many different such contexts may exist and evaluating a DL-atom may be costly even for one context. Thus a natural question to ask is when the evaluation is independent of the context. Such information has immediate applications in optimization of DL-programs, but is also beneficial for other reasoning tasks, like inconsistency diagnosis and program repair. We provide an answer to this question based on a semantic notion of independence and provide a complete characterization of independent DL-atoms. We then extend the characterization to independence under additional information about inclusions among rule predicates. Moreover, we develop an axiomatization which allows one to derive all tautological DL-atoms in the general case and under predicate inclusions. A complexity analysis reveals that checking whether a DL-atom is independent, can be done efficiently. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33203-6_6 | RR |
Keywords | Field | DocType |
special dl-atoms,complete characterization,tautological dl-atoms,independent dl-atoms,semantic independence,natural question,general case,computing answer set,additional information,complexity analysis,description logic program | Ontology (information science),Data mining,Ontology,Ask price,Computer science,Loose coupling,Description logic,Theoretical computer science,Predicate (grammar) | Conference |
Citations | PageRank | References |
1 | 0.35 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Eiter | 1 | 7238 | 532.10 |
| Michael Fink | 2 | 1145 | 62.43 |
| Daria Stepanova | 3 | 46 | 12.10 |