Concepedia

Polynomial Algorithms for Computing a Single Preferred Assertional-Based Repair

Abdelmoutia Telli, Salem Benferhat, Mustapha Bourahla, Zied Bouraoui, Karim Tabia

KI - Künstliche Intelligenz · 2017 · 13 citations · 19 references

DOIFull text

Open access

Concepts

References

19

Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo et al. · Journal of Automated Reasoning · 2007 · 1.4K citations

, , +15

Consistent query answers in inconsistent databases

Marcelo Arenas, Leopoldo Bertossi, Jan Chomicki · 1999 · 887 citations · Full text

, , +10

DL-Lite Family and Relations

2009 · 495 citations

, , +14

Preferred subtheories: an extended logical framework for default reasoning

Gerhard Brewka · 1989 · 422 citations

, , +13

On inference from inconsistent premisses

Nicholas Rescher, Ruth Manor · Theory and Decision · 1970 · 314 citations

, , +9