{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T05:53:47Z","timestamp":1790488427140,"version":"4.1.0"},"reference-count":73,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T00:00:00Z","timestamp":1619049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"European Project H2020 Marie Sklodowska-Curie Actions, Research and Innovation Staff Exchange","award":["691215"],"award-info":[{"award-number":["691215"]}]},{"name":"University of Artoi","award":["AAP A2U QUID"],"award-info":[{"award-number":["AAP A2U QUID"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,23]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We focus on the problem of handling inconsistency in lightweight ontologies. We assume that the terminological knowledge base (TBox) is specified in DL-Lite and that the set of assertional facts (ABox) is partially preordered and may be inconsistent with respect to the TBox. One of the main contributions of this paper is the provision of an efficient and safe method, called Elect, to restore the consistency of the ABox with respect to the TBox. In the case where the assertional base is flat (i.e. no priorities are associated with the ABox) or totally preordered, we show that our method collapses with the well-known intersection ABox repair semantics and the non-defeated semantics, respectively. The semantic justification of the Elect method is obtained by first viewing a partially preordered ABox as a family of totally preordered ABoxes and then applying non-defeated inference to each of the totally preordered ABoxes. We introduce the notion of elected assertions which allows us to provide an equivalent characterization of the Elect method without explicitly generating all the totally preordered ABoxes. We show that computing the set of elected assertions is done in polynomial time with respect to the size of the ABox. The second part of the paper discusses how to go beyond the Elect method. In particular, we discuss to what extent the Elect method can be generalized to description logics that are more expressive than DL-Lite.<\/jats:p>","DOI":"10.1093\/logcom\/exab024","type":"journal-article","created":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T11:09:05Z","timestamp":1617016145000},"page":"1356-1388","source":"Crossref","is-referenced-by-count":12,"title":["Handling inconsistency in partially preordered ontologies: the Elect method"],"prefix":"10.1093","volume":"31","author":[{"given":"Sihem","family":"Belabbes","sequence":"first","affiliation":[{"name":"Laboratoire d'Informatique Avanc\u00e9e de Saint-Denis, Institut Universitaire de Technologie de Montreuil, Universit\u00e9 Paris 8, Saint-Denis, 93526, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salem","family":"Benferhat","sequence":"additional","affiliation":[{"name":"Centre de Recherche en Informatique de Lens, Universit\u00e9 d'Artois & Centre National de la Recherche Scientifique. Lens. 62307. France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Chomicki","sequence":"additional","affiliation":[{"name":"The State University of New York at Buffalo, Buffalo, 14260, State of New York, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2021,4,22]]},"reference":[{"key":"2021080400162655600_ref1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/2274239","article-title":"On the logic of theory change: partial meet contraction and revision functions","volume":"50","author":"Alchourr\u00f3n","year":"1985","journal-title":"Journal of Symbolic Logic"},{"key":"2021080400162655600_ref2","volume-title":"Entailment: The Logic of Relevance and Neccessity","author":"Anderson","year":"1975"},{"key":"2021080400162655600_ref3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/303976.303983","article-title":"Consistent query answers in inconsistent databases","volume-title":"Proceedings of the Eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS\u201999","author":"Arenas","year":"1999"},{"key":"2021080400162655600_ref4","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1017\/S1471068403001832","article-title":"Answer sets for consistent query answering in inconsistent databases","volume":"3","author":"Arenas","year":"2003","journal-title":"Theory and Practice of Logic Programming"},{"key":"2021080400162655600_ref5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s11225-010-9296-9","article-title":"Maximal and premaximal paraconsistency in the framework of three-valued semantics","volume":"97","author":"Arieli","year":"2011","journal-title":"Studia Logica"},{"key":"2021080400162655600_ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2820","article-title":"The DL-lite family and relations","volume":"36","author":"Artale","year":"2009","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"2021080400162655600_ref7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511711787","volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","author":"Baader","year":"2007"},{"key":"2021080400162655600_ref8","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1016\/j.artint.2011.03.002","article-title":"On rules with existential variables: walking the decidability line","volume":"175","author":"Baget","year":"2011","journal-title":"Artificial Intelligence"},{"key":"2021080400162655600_ref9","first-page":"513","article-title":"A general modifier-based framework for inconsistency-tolerant query answering","volume-title":"KR, Cape Town, South Africa","author":"Baget","year":"2016"},{"key":"2021080400162655600_ref10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1111\/j.1467-8640.1992.tb00337.x","article-title":"Combining knowledge bases consisting of first-order analysis","volume":"8","author":"Baral","year":"1992","journal-title":"Computational Intelligence"},{"key":"2021080400162655600_ref11","first-page":"15","article-title":"Inconsistency handling for partially preordered ontologies: going beyond elect","volume-title":"KSEM (1), Athens, Greece","author":"Belabbes","year":"2019"},{"key":"2021080400162655600_ref12","first-page":"210","article-title":"Elect: an inconsistency handling approach for partially preordered lightweight ontologies","author":"Belabbes","year":"2019","journal-title":"LPNMR, Philadelphia, USA"},{"key":"2021080400162655600_ref13","first-page":"1450","article-title":"How to select one preferred assertional-based repair from inconsistent and prioritized DL-lite knowledge bases?","volume-title":"IJCAI, Buenos Aires, Argentina","author":"Benferhat","year":"2015"},{"key":"2021080400162655600_ref14","first-page":"673","article-title":"Representing default rules in possibilistic logic","volume-title":"Knowledge Representation and Reasoning","author":"Benferhat","year":"1992"},{"key":"2021080400162655600_ref15","first-page":"1449","article-title":"How to infer from inconsistent beliefs without revising?","volume-title":"IJCAI, Montr\u00e9al, Canada","author":"Benferhat","year":"1995"},{"key":"2021080400162655600_ref16","first-page":"473","volume-title":"Some Syntactic Approaches to the Handling of Inconsistent Knowledge Bases: A Comparative Study. Part 2: The Prioritized Case","author":"Benferhat","year":"1998"},{"key":"2021080400162655600_ref17","first-page":"282","article-title":"Characterizing non-defeated repairs in inconsistent lightweight ontologies","volume-title":"SITIS, Naples, Italy","author":"Benferhat","year":"2016"},{"key":"2021080400162655600_ref18","first-page":"411","article-title":"Argumentative inference in uncertain and inconsistent knowledge bases","volume-title":"UAI \u201893: Proceedings of the Ninth Annual Conference on Uncertainty in Artificial Intelligence, The Catholic University of America, Providence, Washington DC, USA","author":"Benferhat","year":"1993"},{"key":"2021080400162655600_ref19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.fss.2003.10.012","article-title":"Reasoning with partially ordered information in a possibilistic logic framework","volume":"144","author":"Benferhat","year":"2004","journal-title":"Fuzzy Sets and Systems"},{"key":"2021080400162655600_ref20","doi-asserted-by":"crossref","DOI":"10.2200\/S00379ED1V01Y201108DTM020","volume-title":"Database Repairing and Consistent Query Answering","author":"Bertossi","year":"2011"},{"key":"2021080400162655600_ref21","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/1147376.1147391","article-title":"Consistent query answering in databases","volume":"35","author":"Bertossi","year":"2006","journal-title":"SIGMOD Record"},{"key":"2021080400162655600_ref22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262026437.001.0001","volume-title":"Elements of Argumentation","author":"Besnard","year":"2008"},{"key":"2021080400162655600_ref23","first-page":"996","article-title":"Querying inconsistent description logic knowledge bases under preferred repair semantics","volume-title":"AAAI, Qu\u00e9bec, Canada","author":"Bienvenu","year":"2014"},{"key":"2021080400162655600_ref24","first-page":"775","article-title":"Tractable approximations of consistent query answering for robust ontology-based data access","volume-title":"IJCAI, Beijing, China","author":"Bienvenu","year":"2013"},{"key":"2021080400162655600_ref25","article-title":"On the complexity of consistent query answering in the presence of simple ontologies","volume-title":"Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, Toronto, Canada","author":"Bienvenu","year":"2012"},{"key":"2021080400162655600_ref26","first-page":"156","article-title":"Inconsistency-tolerant querying of description logic knowledge bases","volume-title":"Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering","author":"Bienvenu","year":"2016"},{"key":"2021080400162655600_ref27","first-page":"957","article-title":"Query-driven repairing of inconsistent DL-lite knowledge bases","volume-title":"IJCAI, New York, USA","author":"Bienvenu","year":"2016"},{"key":"2021080400162655600_ref28","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1613\/jair.1.11395","article-title":"Computing and explaining query answers over inconsistent DL-lite knowledge bases","volume":"64","author":"Bienvenu","year":"2019","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2021080400162655600_ref29","first-page":"1043","article-title":"Preferred subtheories: an extended logical framework for default reasoning","volume-title":"IJCAI, Detroit, USA","author":"Brewka","year":"1989"},{"key":"2021080400162655600_ref30","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.websem.2012.03.001","article-title":"A general Datalog-based framework for tractable query answering over ontologies","volume":"14","author":"Cal\u00ec","year":"2012","journal-title":"Journal of Web Semantics"},{"key":"2021080400162655600_ref31","first-page":"112","article-title":"Evolution of DL-lite knowledge bases","volume-title":"International Semantic Web Conference (1)","author":"Calvanese","year":"2010"},{"key":"2021080400162655600_ref32","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10817-007-9078-x","article-title":"Tractable reasoning and efficient query answering in description logics: the DL-lite family","volume":"39","author":"Calvanese","year":"2007","journal-title":"Journal of Automated Reasoning"},{"key":"2021080400162655600_ref33","first-page":"1","volume-title":"Logics of Formal Inconsistency","author":"Carnielli","year":"2007"},{"key":"2021080400162655600_ref34","first-page":"1","article-title":"Consistent query answering: five easy pieces","volume-title":"Database Theory\u2014ICDT, 2007","author":"Chomicki","year":"2007"},{"key":"2021080400162655600_ref35","first-page":"417","volume-title":"Computing consistent query answers using conflict hypergraphs","author":"Chomicki","year":"2004"},{"key":"2021080400162655600_ref36","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(00)00029-1","article-title":"Credal networks","volume":"120","author":"Cozman","year":"2000","journal-title":"Artificial Intelligence"},{"key":"2021080400162655600_ref37","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1305\/ndjfl\/1093891487","article-title":"On the theory of inconsistent formal systems","volume":"15","author":"da Costa","year":"1974","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"2021080400162655600_ref38","first-page":"100","article-title":"Hitting set algorithms for model-based diagnosis","volume-title":"DX Workshop\u201911","author":"de Kleer","year":"2011"},{"key":"2021080400162655600_ref39","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1613\/jair.5131","article-title":"Datalog+\/\u2212 ontology consolidation","volume":"56","author":"Deagustini","year":"2016","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2021080400162655600_ref40","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10115-012-0478-9","article-title":"Weight-based consistent query answering over inconsistent SHIQ knowledge bases","volume":"34","author":"Du","year":"2013","journal-title":"Knowledge and Information Systems"},{"key":"2021080400162655600_ref41","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1613\/jair.1265","article-title":"Ordinal and probabilistic representations of acceptance","volume":"22","author":"Dubois","year":"2004","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2021080400162655600_ref42","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games","volume":"77","author":"Dung","year":"1995","journal-title":"Artificial Intelligence"},{"key":"2021080400162655600_ref43","first-page":"84","article-title":"Inconsistency handling in multi-perspective specifications","volume-title":"Software Engineering\u2014ESEC \u201893, 4th European Software Engineering Conference, Garmisch-Partenkirchen, Germany","author":"Finkelstein","year":"1993"},{"key":"2021080400162655600_ref44","first-page":"337","article-title":"First-order query rewriting for inconsistent databases","volume-title":"Database Theory\u2014ICDT 2005, 10th International Conference, Edinburgh, UK","author":"Fuxman","year":"2005"},{"key":"2021080400162655600_ref45","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-54507-7_3","article-title":"Making inconsistency respectable: a logical framework for inconsistency in reasoning, part I\u2014a position paper","volume-title":"Fundamentals of Artificial Intelligence Research","author":"Gabbay","year":"1991"},{"key":"2021080400162655600_ref46","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/11574620_27","article-title":"A framework for handling inconsistency in changing ontologies","volume-title":"The Semantic Web\u2014ISWC 2005, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6\u201310, 2005, Proceedings","author":"Haase","year":"2005"},{"key":"2021080400162655600_ref47","first-page":"454","article-title":"Reasoning with inconsistent ontologies","volume-title":"IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, UK","author":"Huang","year":"2005"},{"key":"2021080400162655600_ref48","first-page":"1108","article-title":"Model-based diagnosis with multiple observations","volume-title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China","author":"Ignatiev","year":"2019"},{"key":"2021080400162655600_ref49","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(91)90069-V","article-title":"Propositional knowledge base revision and minimal change","volume":"3","author":"Katsuno","year":"1991","journal-title":"Artificial Intelligence"},{"key":"2021080400162655600_ref50","first-page":"247","article-title":"The combined approach to query answering in DL-lite","volume-title":"12th International Conference on Principles of Knowledge Representation and Reasoning (KR), Toronto, Canada","author":"Kontchakov","year":"2010"},{"key":"2021080400162655600_ref51","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-642-15918-3_9","article-title":"Inconsistency-tolerant semantics for description logics","volume-title":"International Conference on Web Reasoning and Rule Systems, Bressanone, Italy","author":"Lembo","year":"2010"},{"key":"2021080400162655600_ref52","first-page":"155","article-title":"Query rewriting for inconsistent DL-lite ontologies","volume-title":"Web Reasoning and Rule Systems\u20145th International Conference, RR 2011, Galway, Ireland, August 29\u201330, 2011. Proceedings","author":"Lembo","year":"2011"},{"key":"2021080400162655600_ref53","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.websem.2015.04.002","article-title":"Inconsistency-tolerant query answering in ontology-based data access","volume":"33","author":"Lembo","year":"2015","journal-title":"Journal of Web Semantics"},{"key":"2021080400162655600_ref54","first-page":"1546","article-title":"From classical to consistent query answering under existential rules","volume-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence 2015","author":"Lukasiewicz","year":"2015"},{"key":"2021080400162655600_ref55","first-page":"558","article-title":"Inconsistency handling in Datalog+\/\u2212 ontologies","volume-title":"ECAI, Montpellier, France","author":"Lukasiewicz","year":"2012"},{"key":"2021080400162655600_ref56","doi-asserted-by":"crossref","first-page":"2962","DOI":"10.1609\/aaai.v33i01.33012962","article-title":"Complexity of inconsistency-tolerant query answering in Datalog+\/\u2212 under cardinality-based repairs","volume":"33","author":"Lukasiewicz","year":"2019","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"2021080400162655600_ref57","first-page":"367","article-title":"Inconsistency management policies","volume-title":"KRR","author":"Martinez","year":"2008"},{"key":"2021080400162655600_ref58","article-title":"OWL 2 Web Ontology Language Profiles. W3C Recommendation. 11 December 2012","author":"Motik"},{"key":"2021080400162655600_ref59","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s13218-020-00678-3","article-title":"Data access with horn ontologies: where description logics meet existential rules","volume":"34","author":"Mugnier","year":"2020","journal-title":"K\u00fcnstliche Intelligenz"},{"key":"2021080400162655600_ref60","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-319-10587-1_6","article-title":"An introduction to ontology-based query answering with existential rules","volume-title":"Reasoning Web. Reasoning on the Web in the Big Data Era\u201410th International Summer School, Athens, Greece","author":"Mugnier","year":"2014"},{"key":"2021080400162655600_ref61","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-94-017-0460-1_4","volume-title":"Handbook of Philosophical Logic","author":"Priest","year":"2002"},{"key":"2021080400162655600_ref62","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default resoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"key":"2021080400162655600_ref63","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","article-title":"A theory of diagnosis from first principles","volume":"32","author":"Reiter","year":"1987","journal-title":"Artificial Intelligence"},{"key":"2021080400162655600_ref64","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF00154005","article-title":"On inference from inconsistent premisses","volume":"1","author":"Rescher","year":"1970","journal-title":"Theory and Decision"},{"key":"2021080400162655600_ref65","first-page":"1057","article-title":"On the complexity of dealing with inconsistency in description logic ontologies","volume-title":"IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Spain","author":"Rosati","year":"2011"},{"key":"2021080400162655600_ref66","first-page":"355","article-title":"Non-standard reasoning services for the debugging of description logic terminologies","volume-title":"IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9\u201315, 2003","author":"Schlobach","year":"2003"},{"key":"2021080400162655600_ref67","first-page":"209","article-title":"Prioritized repairing and consistent query answering in relational databases","volume":"64","author":"Staworko","year":"2012","journal-title":"AMAI"},{"key":"2021080400162655600_ref68","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s13218-016-0466-4","article-title":"Polynomial algorithms for computing a single preferred assertional-based repair","volume":"31","author":"Telli","year":"2017","journal-title":"K\u00fcnstliche Intelligenz"},{"key":"2021080400162655600_ref69","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1016\/j.jal.2015.09.002","article-title":"Possibilistic reasoning with partially ordered beliefs","volume":"13","author":"Touazi","year":"2015","journal-title":"Journal of Applied Logic"},{"key":"2021080400162655600_ref70","volume-title":"The Uses of Argument","author":"Toulmin","year":"1956"},{"key":"2021080400162655600_ref71","article-title":"Querying expressive DL ontologies under the ICAR semantics","volume-title":"Proceedings of the 31st DL Workshop. Tempe, USA","author":"Trivela","year":"2018"},{"key":"2021080400162655600_ref72","first-page":"1279","article-title":"Efficient query answering over expressive inconsistent description logics","volume-title":"IJCAI, New York, USA","author":"Tsalapati","year":"2016"},{"key":"2021080400162655600_ref73","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/3377391.3377393","article-title":"Foundations of query answering on inconsistent databases","volume":"48","author":"Wijsen","year":"2019","journal-title":"SIGMOD Record"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/31\/5\/1356\/39554972\/exab024.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/31\/5\/1356\/39554972\/exab024.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:17:32Z","timestamp":1628036252000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/31\/5\/1356\/6240182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,22]]},"references-count":73,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2021,4,22]]},"published-print":{"date-parts":[[2021,7,23]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exab024","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2021,7]]},"published":{"date-parts":[[2021,4,22]]}}}