Add to ORKGInternational audienceThis extended abstract presents our work on explaining why a tuple is a (non-)answer to a query under the three well-known inconsistency-tolerant semantics AR, IAR, and brave
The problem of querying description logic knowledge bases using database-style queries (in particula...
Querying inconsistent knowledge bases is an intriguing problem that gave rise to a flourishing resear...
In order to meet usability requirements, most logic-based applications provide explana-tion faciliti...
International audienceThis extended abstract presents our work on explaining why a tuple is a (non-)...
International audienceSeveral inconsistency-tolerant semantics have been introduced for querying inc...
International audienceSeveral inconsistency-tolerant semantics have been introduced for querying inc...
Inconsistency-tolerant semantics have been proposed to provide meaningful query answers even in the ...
International audienceAn important issue that arises when querying description logic (DL) knowledge ...
We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge bases. Ou...
Querying inconsistent knowledge bases is a problem that has attracted a great deal of interest over ...
Querying inconsistent knowledge bases is a problem that has attracted a great deal of interest over ...
Abstract. We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge...
We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge bases. Ou...
Interroger des bases de connaissances avec des requêtes conjonctives a été une préoccupation majeure...
The problem of querying description logic knowledge bases using database-style queries (in particula...
Querying inconsistent knowledge bases is an intriguing problem that gave rise to a flourishing resear...
In order to meet usability requirements, most logic-based applications provide explana-tion faciliti...
International audienceThis extended abstract presents our work on explaining why a tuple is a (non-)...
International audienceSeveral inconsistency-tolerant semantics have been introduced for querying inc...
International audienceSeveral inconsistency-tolerant semantics have been introduced for querying inc...
Inconsistency-tolerant semantics have been proposed to provide meaningful query answers even in the ...
International audienceAn important issue that arises when querying description logic (DL) knowledge ...
We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge bases. Ou...
Querying inconsistent knowledge bases is a problem that has attracted a great deal of interest over ...
Querying inconsistent knowledge bases is a problem that has attracted a great deal of interest over ...
Abstract. We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge...
We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge bases. Ou...
Interroger des bases de connaissances avec des requêtes conjonctives a été une préoccupation majeure...
The problem of querying description logic knowledge bases using database-style queries (in particula...
Querying inconsistent knowledge bases is an intriguing problem that gave rise to a flourishing resear...
In order to meet usability requirements, most logic-based applications provide explana-tion faciliti...