Inconsistency-tolerant query answering for existential rules

Querying inconsistent knowledge bases is an intriguing problem that gave rise to a flourishing research activity in the knowledge representation and reasoning community during the last years. It has been extensively studied in the context of description logics (DLs), and its computational complexity...

Full description

Saved in:
Bibliographic Details
Published inArtificial intelligence Vol. 307; p. 103685
Main Authors Lukasiewicz, Thomas, Malizia, Enrico, Martinez, Maria Vanina, Molinaro, Cristian, Pieris, Andreas, Simari, Gerardo I.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.06.2022
Elsevier Science Ltd
Subjects
Complexity
Computational complexity
Conjunctive queries
Inconsistency
Intersections
Knowledge bases (artificial intelligence)
Knowledge representation
Ontology
Query answering
Relational data bases
Rule-based ontologies
Semantics
Query answering
Inconsistency
Semantics
Computational complexity
Rule-based ontologies
Conjunctive queries
Online AccessGet full text

Cover

Abstract Querying inconsistent knowledge bases is an intriguing problem that gave rise to a flourishing research activity in the knowledge representation and reasoning community during the last years. It has been extensively studied in the context of description logics (DLs), and its computational complexity is rather well-understood. Although DLs are popular formalisms for modeling ontologies, it is generally agreed that rule-based ontologies are well-suited for data-intensive applications, since they allow us to conveniently deal with higher-arity relations, which naturally occur in standard relational databases. The goal of this work is to perform an in-depth complexity analysis of querying inconsistent knowledge bases in the case of the main decidable classes of existential rules, based on the notions of guardedness, linearity, acyclicity, and stickiness, enriched with negative (a.k.a. denial) constraints. Our investigation concentrates on three central inconsistency-tolerant semantics: the ABox repair (AR) semantics, considered as the standard one, and its main sound approximations, the intersection of repairs (IAR) semantics and the intersection of closed repairs (ICR) semantics.
AbstractList Querying inconsistent knowledge bases is an intriguing problem that gave rise to a flourishing research activity in the knowledge representation and reasoning community during the last years. It has been extensively studied in the context of description logics (DLs), and its computational complexity is rather well-understood. Although DLs are popular formalisms for modeling ontologies, it is generally agreed that rule-based ontologies are well-suited for data-intensive applications, since they allow us to conveniently deal with higher-arity relations, which naturally occur in standard relational databases. The goal of this work is to perform an in-depth complexity analysis of querying inconsistent knowledge bases in the case of the main decidable classes of existential rules, based on the notions of guardedness, linearity, acyclicity, and stickiness, enriched with negative (a.k.a. denial) constraints. Our investigation concentrates on three central inconsistency-tolerant semantics: the ABox repair (AR) semantics, considered as the standard one, and its main sound approximations, the intersection of repairs (IAR) semantics and the intersection of closed repairs (ICR) semantics.
ArticleNumber 103685
Author Malizia, Enrico
Pieris, Andreas
Martinez, Maria Vanina
Lukasiewicz, Thomas
Simari, Gerardo I.
Molinaro, Cristian
Author_xml – sequence: 1
  givenname: Thomas
  surname: Lukasiewicz
  fullname: Lukasiewicz, Thomas
  email: thomas.lukasiewicz@cs.ox.ac.uk
  organization: Department of Computer Science, University of Oxford, UK
– sequence: 2
  givenname: Enrico
  surname: Malizia
  fullname: Malizia, Enrico
  email: enrico.malizia@unibo.it
  organization: DISI, University of Bologna, Italy
– sequence: 3
  givenname: Maria Vanina
  surname: Martinez
  fullname: Martinez, Maria Vanina
  email: mvmartinez@dc.uba.ar
  organization: Department of Computer Science, Universidad de Buenos Aires, Argentina
– sequence: 4
  givenname: Cristian
  surname: Molinaro
  fullname: Molinaro, Cristian
  email: cmolinaro@dimes.unical.it
  organization: DIMES, University of Calabria, Italy
– sequence: 5
  givenname: Andreas
  surname: Pieris
  fullname: Pieris, Andreas
  email: apieris@inf.ed.ac.uk
  organization: School of Informatics, University of Edinburgh, UK
– sequence: 6
  givenname: Gerardo I.
  orcidid: 0000-0003-3185-4992
  surname: Simari
  fullname: Simari, Gerardo I.
  email: gis@cs.uns.edu.ar
  organization: Dept. of Computer Science and Engineering, Universidad Nacional del Sur (UNS), Argentina
BookMark eNp9kE1LAzEQhoNUsK3-Aw8Lnrfma5MNiCDFj0LBi55DNslKljWpSar235u6nj0NM7zvzLzPAsx88BaASwRXCCJ2PaxUzM7nFYYYlxFhbXMC5qjluOYCoxmYQwhpTTjEZ2CR0lBaIgSag5uN18Enl7L1-lDnMNqofK4-9jYeKuXTl43Ov1V9iJX9_pVlp8Yq7kebzsFpr8ZkL_7qErw-3L-sn-rt8-NmfbetNSE01wJBJkzbYWyI1rQzDPVcCSYYZh3rO0GNEJoKjTmBbWcaRYlqGt4jRLVRnCzB1bR3F0N5LGU5hH305aTEHJIShQtYVHRS6RhSiraXu-jeVTxIBOWRkxzkxEkeOcmJU7HdTjZbEnw6G2XSrsCwxkWrszTB_b_gB1MDdOI
CitedBy_id crossref_primary_10_1016_j_artint_2024_104176
crossref_primary_10_1109_MIS_2022_3218913
crossref_primary_10_1016_j_artint_2022_103772
crossref_primary_10_1016_j_tcs_2022_09_005
Cites_doi 10.1016/j.websem.2012.03.001
10.1006/jcss.2000.1729
10.1016/j.websem.2015.04.002
10.1016/j.tcs.2017.06.023
10.1613/jair.3873
10.1613/jair.1.11395
10.1016/j.artint.2012.08.002
10.1016/j.ic.2004.04.007
10.1016/0022-0000(89)90025-1
10.1145/502807.502810
10.1016/j.artint.2011.06.002
10.1016/j.tcs.2004.10.033
10.1145/2638546
ContentType Journal Article
Copyright 2022 Elsevier B.V.
Copyright Elsevier Science Ltd. Jun 2022
Copyright_xml – notice: 2022 Elsevier B.V.
– notice: Copyright Elsevier Science Ltd. Jun 2022
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.artint.2022.103685
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-7921
ExternalDocumentID 10_1016_j_artint_2022_103685
S000437022200025X
GroupedDBID --K
--M
--Z
-~X
.DC
.~1
0R~
1B1
1~.
1~5
23N
4.4
457
4G.
5GY
5VS
6I.
6J9
6TJ
7-5
71M
77K
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AAKPC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABFNM
ABFRF
ABJNI
ABMAC
ABVKL
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACWUS
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AECPX
AEFWE
AEKER
AENEX
AETEA
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
E3Z
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F0J
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
IXB
J1W
JJJVA
KOM
KQ8
LG9
LY7
M41
MO0
MVM
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
RNS
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SET
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
TAE
TN5
TR2
TWZ
UPT
UQL
VQA
WH7
WUQ
XFK
XJE
XJT
XPP
XSW
ZMT
~02
~G-
0SF
AAXKI
AAYXX
ADVLN
AFJKZ
AKRWK
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c334t-91069d8b22d3cc4bd61f7a969626b6fb94d99c49c27308bd5a43a557f114cda73
IEDL.DBID AIKHN
ISSN 0004-3702
IngestDate Tue Sep 24 20:56:45 EDT 2024
Fri Sep 27 09:35:12 EDT 2024
Fri Feb 23 02:39:36 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Query answering
Inconsistency
Semantics
Computational complexity
Rule-based ontologies
Conjunctive queries
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c334t-91069d8b22d3cc4bd61f7a969626b6fb94d99c49c27308bd5a43a557f114cda73
ORCID 0000-0003-3185-4992
PQID 2703039790
PQPubID 2038285
ParticipantIDs proquest_journals_2703039790
crossref_primary_10_1016_j_artint_2022_103685
elsevier_sciencedirect_doi_10_1016_j_artint_2022_103685
PublicationCentury 2000
PublicationDate June 2022
2022-06-00
20220601
PublicationDateYYYYMMDD 2022-06-01
PublicationDate_xml – month: 06
  year: 2022
  text: June 2022
PublicationDecade 2020
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Artificial intelligence
PublicationYear 2022
Publisher Elsevier B.V
Elsevier Science Ltd
Publisher_xml – name: Elsevier B.V
– name: Elsevier Science Ltd
References Calì, Gottlob, Lukasiewicz (br0110) 2012; 14
Ceylan, Lukasiewicz, Malizia, Vaicenavičius (br0150) 2020
Deutsch, Nash, Remmel (br0190) 2008
Eiter, Lukasiewicz, Predoiu (br0200) 2016
Arenas, Bertossi, Chomicki (br0010) 1999
Beeri, Vardi (br0020) 1981
Lukasiewicz, Malizia (br0320) 2016
Rosati (br0440) 2011
Bienvenu (br0030) 2012
Gottlob, Malizia (br0220) 2014
Bienvenu (br0040) 2019
Lukasiewicz, Martinez, Pieris, Simari (br0370) 2015
Dantsin, Voronkov (br0180) 1997
Calì, Gottlob, Pieris (br0130) 2012; 193
Fagin, Kolaitis, Miller, Popa (br0210) 2005; 336
Bienvenu, Bourgaux, Goasdoué (br0070) 2019; 64
Lukasiewicz, Malizia, Molinaro (br0340) 2018
Lembo, Ruzzi (br0310) 2007
Schaefer (br0450) 2001; 62
Bienvenu, Bourgaux, Goasdoué (br0060) 2014
Gottlob, Orsi, Pieris (br0240) 2014; 39
Calì, Gottlob, Lukasiewicz, Marnette, Pieris (br0120) 2010
Martinez, Simari (br0410) 2019
Schöning, Wagner (br0460) 1988
Vardi (br0470) 1995
Lembo, Lenzerini, Rosati, Ruzzi, Savo (br0300) 2015; 33
Chomicki, Marcinkowski (br0160) 2005; 197
Papadimitriou (br0420) 1994
Calì, Gottlob, Kifer (br0100) 2013; 48
Lukasiewicz, Malizia, Vaicenavicius (br0360) 2019
Dantsin, Eiter, Gottlob, Voronkov (br0170) 2001; 33
Greco, Malizia, Palopoli, Scarcello (br0250) 2011; 175
Bienvenu, Bourgaux (br0050) 2016
Bienvenu, Rosati (br0080) 2013
Johnson (br0270) 1990
Lukasiewicz, Malizia (br0330) 2017; 694
Lukasiewicz, Malizia, Molinaro (br0350) 2020
Bienvenu, Rosati (br0090) 2013
Lukasiewicz, Martinez, Simari (br0400) 2013
Hemachandra (br0260) 1989; 39
Ceylan, Lukasiewicz, Malizia, Vaicenavičius (br0140) 2019
Gottlob, Manna, Pieris (br0230) 2014
Lembo, Lenzerini, Rosati, Ruzzi, Savo (br0280) 2010
Lembo, Lenzerini, Rosati, Ruzzi, Savo (br0290) 2011
Poggi, Lembo, Calvanese, De Giacomo, Lenzerini, Rosati (br0430) 2008; 10
Lukasiewicz, Martinez, Simari (br0380) 2012
Lukasiewicz, Martinez, Simari (br0390) 2012
Gottlob (10.1016/j.artint.2022.103685_br0240) 2014; 39
Johnson (10.1016/j.artint.2022.103685_br0270) 1990
Lukasiewicz (10.1016/j.artint.2022.103685_br0320) 2016
Arenas (10.1016/j.artint.2022.103685_br0010) 1999
Lukasiewicz (10.1016/j.artint.2022.103685_br0340) 2018
Lukasiewicz (10.1016/j.artint.2022.103685_br0400) 2013
Martinez (10.1016/j.artint.2022.103685_br0410) 2019
Lukasiewicz (10.1016/j.artint.2022.103685_br0330) 2017; 694
Beeri (10.1016/j.artint.2022.103685_br0020) 1981
Calì (10.1016/j.artint.2022.103685_br0120) 2010
Eiter (10.1016/j.artint.2022.103685_br0200) 2016
Ceylan (10.1016/j.artint.2022.103685_br0140) 2019
Lembo (10.1016/j.artint.2022.103685_br0300) 2015; 33
Vardi (10.1016/j.artint.2022.103685_br0470) 1995
Bienvenu (10.1016/j.artint.2022.103685_br0040) 2019
Lukasiewicz (10.1016/j.artint.2022.103685_br0350) 2020
Calì (10.1016/j.artint.2022.103685_br0100) 2013; 48
Chomicki (10.1016/j.artint.2022.103685_br0160) 2005; 197
Lembo (10.1016/j.artint.2022.103685_br0310) 2007
Poggi (10.1016/j.artint.2022.103685_br0430) 2008; 10
Bienvenu (10.1016/j.artint.2022.103685_br0030) 2012
Bienvenu (10.1016/j.artint.2022.103685_br0070) 2019; 64
Rosati (10.1016/j.artint.2022.103685_br0440) 2011
Dantsin (10.1016/j.artint.2022.103685_br0170) 2001; 33
Dantsin (10.1016/j.artint.2022.103685_br0180) 1997
Bienvenu (10.1016/j.artint.2022.103685_br0060) 2014
Bienvenu (10.1016/j.artint.2022.103685_br0080) 2013
Bienvenu (10.1016/j.artint.2022.103685_br0090) 2013
Fagin (10.1016/j.artint.2022.103685_br0210) 2005; 336
Hemachandra (10.1016/j.artint.2022.103685_br0260) 1989; 39
Bienvenu (10.1016/j.artint.2022.103685_br0050) 2016
Calì (10.1016/j.artint.2022.103685_br0130) 2012; 193
Deutsch (10.1016/j.artint.2022.103685_br0190) 2008
Schaefer (10.1016/j.artint.2022.103685_br0450) 2001; 62
Lembo (10.1016/j.artint.2022.103685_br0290) 2011
Lembo (10.1016/j.artint.2022.103685_br0280) 2010
Lukasiewicz (10.1016/j.artint.2022.103685_br0390) 2012
Lukasiewicz (10.1016/j.artint.2022.103685_br0370) 2015
Calì (10.1016/j.artint.2022.103685_br0110) 2012; 14
Lukasiewicz (10.1016/j.artint.2022.103685_br0380) 2012
Ceylan (10.1016/j.artint.2022.103685_br0150) 2020
Lukasiewicz (10.1016/j.artint.2022.103685_br0360) 2019
Papadimitriou (10.1016/j.artint.2022.103685_br0420) 1994
Greco (10.1016/j.artint.2022.103685_br0250) 2011; 175
Gottlob (10.1016/j.artint.2022.103685_br0230) 2014
Schöning (10.1016/j.artint.2022.103685_br0460) 1988
Gottlob (10.1016/j.artint.2022.103685_br0220) 2014
References_xml – start-page: 2909
  year: 2020
  end-page: 2916
  ident: br0350
  article-title: Explanations for inconsistency-tolerant query answering under existential rules
  publication-title: AAAI
  contributor:
    fullname: Molinaro
– volume: 64
  start-page: 563
  year: 2019
  end-page: 644
  ident: br0070
  article-title: Computing and explaining query answers over inconsistent dl-lite knowledge bases
  publication-title: J. Artif. Intell. Res.
  contributor:
    fullname: Goasdoué
– volume: 694
  start-page: 21
  year: 2017
  end-page: 33
  ident: br0330
  article-title: A novel characterization of the complexity class
  publication-title: Theor. Comput. Sci.
  contributor:
    fullname: Malizia
– start-page: 266
  year: 1995
  end-page: 276
  ident: br0470
  article-title: On the complexity of bounded-variable queries
  publication-title: PODS
  contributor:
    fullname: Vardi
– year: 1994
  ident: br0420
  article-title: Computational Complexity
  contributor:
    fullname: Papadimitriou
– start-page: 67
  year: 1990
  end-page: 161
  ident: br0270
  article-title: A catalog of complexity classes
  publication-title: Handbook of Theoretical Computer Science (vol. A)
  contributor:
    fullname: Johnson
– start-page: 194
  year: 2007
  end-page: 208
  ident: br0310
  article-title: Consistent query answering over description logic ontologies
  publication-title: RR
  contributor:
    fullname: Ruzzi
– start-page: 53
  year: 2013
  end-page: 64
  ident: br0080
  article-title: New inconsistency-tolerant semantics for robust ontology-based data access
  publication-title: DL
  contributor:
    fullname: Rosati
– volume: 62
  start-page: 290
  year: 2001
  end-page: 322
  ident: br0450
  article-title: Graph Ramsey theory and the polynomial hierarchy
  publication-title: J. Comput. Syst. Sci.
  contributor:
    fullname: Schaefer
– start-page: 705
  year: 2012
  end-page: 711
  ident: br0030
  article-title: On the complexity of consistent query answering in the presence of simple ontologies
  publication-title: AAAI
  contributor:
    fullname: Bienvenu
– start-page: 123
  year: 2012
  end-page: 134
  ident: br0390
  article-title: Inconsistency-tolerant query rewriting for linear Datalog+/-
  publication-title: Datalog 2.0
  contributor:
    fullname: Simari
– start-page: 73
  year: 1981
  end-page: 85
  ident: br0020
  article-title: The implication problem for data dependencies
  publication-title: ICALP
  contributor:
    fullname: Vardi
– volume: 336
  start-page: 89
  year: 2005
  end-page: 124
  ident: br0210
  article-title: Data exchange: semantics and query answering
  publication-title: Theor. Comput. Sci.
  contributor:
    fullname: Popa
– start-page: 1921
  year: 2018
  end-page: 1927
  ident: br0340
  article-title: Complexity of approximate query answering under inconsistency in Datalog+/-
  publication-title: IJCAI
  contributor:
    fullname: Molinaro
– year: 2019
  ident: br0040
  article-title: Inconsistency handling in ontology-mediated query answering: a progress report
  publication-title: DL
  contributor:
    fullname: Bienvenu
– start-page: 103
  year: 2010
  end-page: 117
  ident: br0280
  article-title: Inconsistency-tolerant semantics for description logics
  publication-title: RR
  contributor:
    fullname: Savo
– start-page: 155
  year: 2011
  end-page: 169
  ident: br0290
  article-title: Query rewriting for inconsistent dl-lite ontologies
  publication-title: RR
  contributor:
    fullname: Savo
– start-page: 672
  year: 2020
  end-page: 679
  ident: br0150
  article-title: Explanations for ontology-mediated query answering in description logics
  publication-title: ECAI
  contributor:
    fullname: Vaicenavičius
– volume: 10
  start-page: 133
  year: 2008
  end-page: 173
  ident: br0430
  article-title: Linking data to ontologies
  publication-title: J. Data Semant.
  contributor:
    fullname: Rosati
– start-page: 558
  year: 2012
  end-page: 563
  ident: br0380
  article-title: Inconsistency handling in Datalog+/- ontologies
  publication-title: ECAI
  contributor:
    fullname: Simari
– start-page: 1057
  year: 2011
  end-page: 1062
  ident: br0440
  article-title: On the complexity of dealing with inconsistency in description logic ontologies
  publication-title: IJCAI
  contributor:
    fullname: Rosati
– start-page: 65
  year: 2019
  end-page: 103
  ident: br0410
  article-title: Explanation-friendly query answering under uncertainty
  publication-title: Reasoning Web
  contributor:
    fullname: Simari
– volume: 39
  start-page: 299
  year: 1989
  end-page: 322
  ident: br0260
  article-title: The strong exponential hierarchy collapses
  publication-title: J. Comput. Syst. Sci.
  contributor:
    fullname: Hemachandra
– volume: 197
  start-page: 90
  year: 2005
  end-page: 121
  ident: br0160
  article-title: Minimal-change integrity maintenance using tuple deletions
  publication-title: Inf. Comput.
  contributor:
    fullname: Marcinkowski
– start-page: 268
  year: 2014
  end-page: 277
  ident: br0230
  article-title: Polynomial combined rewritings for existential rules
  publication-title: KR
  contributor:
    fullname: Pieris
– start-page: 2962
  year: 2019
  end-page: 2969
  ident: br0360
  article-title: Complexity of inconsistency-tolerant query answering in Datalog+/- under cardinality-based repairs
  publication-title: AAAI
  contributor:
    fullname: Vaicenavicius
– start-page: 156
  year: 2016
  end-page: 202
  ident: br0050
  article-title: Inconsistency-tolerant querying of description logic knowledge bases
  publication-title: Reasoning Web
  contributor:
    fullname: Bourgaux
– start-page: 775
  year: 2013
  end-page: 781
  ident: br0090
  article-title: Tractable approximations of consistent query answering for robust ontology-based data access
  publication-title: IJCAI
  contributor:
    fullname: Rosati
– volume: 14
  start-page: 57
  year: 2012
  end-page: 83
  ident: br0110
  article-title: A general Datalog-based framework for tractable query answering over ontologies
  publication-title: J. Web Semant.
  contributor:
    fullname: Lukasiewicz
– start-page: 996
  year: 2014
  end-page: 1002
  ident: br0060
  article-title: Querying inconsistent description logic knowledge bases under preferred repair semantics
  publication-title: AAAI
  contributor:
    fullname: Goasdoué
– volume: 48
  start-page: 115
  year: 2013
  end-page: 174
  ident: br0100
  article-title: Taming the infinite chase: query answering under expressive relational constraints
  publication-title: J. Artif. Intell. Res.
  contributor:
    fullname: Kifer
– start-page: 56
  year: 1997
  end-page: 66
  ident: br0180
  article-title: Complexity of query answering in logic databases with complex values
  publication-title: LFCS
  contributor:
    fullname: Voronkov
– year: 2014
  ident: br0220
  article-title: Achieving new upper bounds for the hypergraph duality problem through logic
  publication-title: CSL-LICS
  contributor:
    fullname: Malizia
– start-page: 91
  year: 1988
  end-page: 97
  ident: br0460
  article-title: Collapsing oracle hierarchies, census functions and logarithmically many queries
  publication-title: STACS
  contributor:
    fullname: Wagner
– start-page: 1639
  year: 2019
  end-page: 1646
  ident: br0140
  article-title: Explanations for query answers under existential rules
  publication-title: IJCAI
  contributor:
    fullname: Vaicenavičius
– volume: 33
  start-page: 3
  year: 2015
  end-page: 29
  ident: br0300
  article-title: Inconsistency-tolerant query answering in ontology-based data access
  publication-title: J. Web Semant.
  contributor:
    fullname: Savo
– start-page: 488
  year: 2013
  end-page: 500
  ident: br0400
  article-title: Complexity of inconsistency-tolerant query answering in Datalog+/-
  publication-title: ODBASE
  contributor:
    fullname: Simari
– volume: 39
  year: 2014
  ident: br0240
  article-title: Query rewriting and optimization for ontological databases
  publication-title: ACM Trans. Database Syst.
  contributor:
    fullname: Pieris
– volume: 33
  start-page: 374
  year: 2001
  end-page: 425
  ident: br0170
  article-title: Complexity and expressive power of logic programming
  publication-title: ACM Comput. Surv.
  contributor:
    fullname: Voronkov
– start-page: 558
  year: 2016
  end-page: 564
  ident: br0320
  article-title: On the complexity of
  publication-title: AAAI
  contributor:
    fullname: Malizia
– start-page: 149
  year: 2008
  end-page: 158
  ident: br0190
  article-title: The chase revisited
  publication-title: PODS
  contributor:
    fullname: Remmel
– volume: 193
  start-page: 87
  year: 2012
  end-page: 128
  ident: br0130
  article-title: Towards more expressive ontology languages: the query answering problem
  publication-title: Artif. Intell.
  contributor:
    fullname: Pieris
– start-page: 68
  year: 1999
  end-page: 79
  ident: br0010
  article-title: Consistent query answers in inconsistent databases
  publication-title: PODS
  contributor:
    fullname: Chomicki
– volume: 175
  start-page: 1877
  year: 2011
  end-page: 1910
  ident: br0250
  article-title: On the complexity of core, kernel, and bargaining set
  publication-title: Artif. Intell.
  contributor:
    fullname: Scarcello
– start-page: 1546
  year: 2015
  end-page: 1552
  ident: br0370
  article-title: From classical to consistent query answering under existential rules
  publication-title: AAAI
  contributor:
    fullname: Simari
– start-page: 228
  year: 2010
  end-page: 242
  ident: br0120
  article-title: Datalog+/-: a family of logical knowledge representation and query languages for new applications
  publication-title: LICS
  contributor:
    fullname: Pieris
– start-page: 359
  year: 2016
  end-page: 368
  ident: br0200
  article-title: Generalized consistent query answering under existential rules
  publication-title: KR
  contributor:
    fullname: Predoiu
– start-page: 194
  year: 2007
  ident: 10.1016/j.artint.2022.103685_br0310
  article-title: Consistent query answering over description logic ontologies
  contributor:
    fullname: Lembo
– start-page: 1546
  year: 2015
  ident: 10.1016/j.artint.2022.103685_br0370
  article-title: From classical to consistent query answering under existential rules
  contributor:
    fullname: Lukasiewicz
– start-page: 56
  year: 1997
  ident: 10.1016/j.artint.2022.103685_br0180
  article-title: Complexity of query answering in logic databases with complex values
  contributor:
    fullname: Dantsin
– year: 1994
  ident: 10.1016/j.artint.2022.103685_br0420
  contributor:
    fullname: Papadimitriou
– start-page: 1057
  year: 2011
  ident: 10.1016/j.artint.2022.103685_br0440
  article-title: On the complexity of dealing with inconsistency in description logic ontologies
  contributor:
    fullname: Rosati
– start-page: 705
  year: 2012
  ident: 10.1016/j.artint.2022.103685_br0030
  article-title: On the complexity of consistent query answering in the presence of simple ontologies
  contributor:
    fullname: Bienvenu
– start-page: 996
  year: 2014
  ident: 10.1016/j.artint.2022.103685_br0060
  article-title: Querying inconsistent description logic knowledge bases under preferred repair semantics
  contributor:
    fullname: Bienvenu
– start-page: 558
  year: 2016
  ident: 10.1016/j.artint.2022.103685_br0320
  article-title: On the complexity of mCP-nets
  contributor:
    fullname: Lukasiewicz
– year: 2014
  ident: 10.1016/j.artint.2022.103685_br0220
  article-title: Achieving new upper bounds for the hypergraph duality problem through logic
  contributor:
    fullname: Gottlob
– start-page: 672
  year: 2020
  ident: 10.1016/j.artint.2022.103685_br0150
  article-title: Explanations for ontology-mediated query answering in description logics
  contributor:
    fullname: Ceylan
– start-page: 558
  year: 2012
  ident: 10.1016/j.artint.2022.103685_br0380
  article-title: Inconsistency handling in Datalog+/- ontologies
  contributor:
    fullname: Lukasiewicz
– volume: 14
  start-page: 57
  year: 2012
  ident: 10.1016/j.artint.2022.103685_br0110
  article-title: A general Datalog-based framework for tractable query answering over ontologies
  publication-title: J. Web Semant.
  doi: 10.1016/j.websem.2012.03.001
  contributor:
    fullname: Calì
– start-page: 65
  year: 2019
  ident: 10.1016/j.artint.2022.103685_br0410
  article-title: Explanation-friendly query answering under uncertainty
  contributor:
    fullname: Martinez
– volume: 62
  start-page: 290
  issue: 2
  year: 2001
  ident: 10.1016/j.artint.2022.103685_br0450
  article-title: Graph Ramsey theory and the polynomial hierarchy
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1006/jcss.2000.1729
  contributor:
    fullname: Schaefer
– start-page: 2909
  year: 2020
  ident: 10.1016/j.artint.2022.103685_br0350
  article-title: Explanations for inconsistency-tolerant query answering under existential rules
  contributor:
    fullname: Lukasiewicz
– volume: 33
  start-page: 3
  year: 2015
  ident: 10.1016/j.artint.2022.103685_br0300
  article-title: Inconsistency-tolerant query answering in ontology-based data access
  publication-title: J. Web Semant.
  doi: 10.1016/j.websem.2015.04.002
  contributor:
    fullname: Lembo
– volume: 694
  start-page: 21
  year: 2017
  ident: 10.1016/j.artint.2022.103685_br0330
  article-title: A novel characterization of the complexity class θkP based on counting and comparison
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2017.06.023
  contributor:
    fullname: Lukasiewicz
– start-page: 123
  year: 2012
  ident: 10.1016/j.artint.2022.103685_br0390
  article-title: Inconsistency-tolerant query rewriting for linear Datalog+/-
  contributor:
    fullname: Lukasiewicz
– start-page: 1921
  year: 2018
  ident: 10.1016/j.artint.2022.103685_br0340
  article-title: Complexity of approximate query answering under inconsistency in Datalog+/-
  contributor:
    fullname: Lukasiewicz
– volume: 48
  start-page: 115
  year: 2013
  ident: 10.1016/j.artint.2022.103685_br0100
  article-title: Taming the infinite chase: query answering under expressive relational constraints
  publication-title: J. Artif. Intell. Res.
  doi: 10.1613/jair.3873
  contributor:
    fullname: Calì
– start-page: 156
  year: 2016
  ident: 10.1016/j.artint.2022.103685_br0050
  article-title: Inconsistency-tolerant querying of description logic knowledge bases
  contributor:
    fullname: Bienvenu
– start-page: 67
  year: 1990
  ident: 10.1016/j.artint.2022.103685_br0270
  article-title: A catalog of complexity classes
  contributor:
    fullname: Johnson
– start-page: 266
  year: 1995
  ident: 10.1016/j.artint.2022.103685_br0470
  article-title: On the complexity of bounded-variable queries
  contributor:
    fullname: Vardi
– start-page: 91
  year: 1988
  ident: 10.1016/j.artint.2022.103685_br0460
  article-title: Collapsing oracle hierarchies, census functions and logarithmically many queries
  contributor:
    fullname: Schöning
– start-page: 775
  year: 2013
  ident: 10.1016/j.artint.2022.103685_br0090
  article-title: Tractable approximations of consistent query answering for robust ontology-based data access
  contributor:
    fullname: Bienvenu
– volume: 64
  start-page: 563
  year: 2019
  ident: 10.1016/j.artint.2022.103685_br0070
  article-title: Computing and explaining query answers over inconsistent dl-lite knowledge bases
  publication-title: J. Artif. Intell. Res.
  doi: 10.1613/jair.1.11395
  contributor:
    fullname: Bienvenu
– start-page: 359
  year: 2016
  ident: 10.1016/j.artint.2022.103685_br0200
  article-title: Generalized consistent query answering under existential rules
  contributor:
    fullname: Eiter
– start-page: 103
  year: 2010
  ident: 10.1016/j.artint.2022.103685_br0280
  article-title: Inconsistency-tolerant semantics for description logics
  contributor:
    fullname: Lembo
– start-page: 2962
  year: 2019
  ident: 10.1016/j.artint.2022.103685_br0360
  article-title: Complexity of inconsistency-tolerant query answering in Datalog+/- under cardinality-based repairs
  contributor:
    fullname: Lukasiewicz
– start-page: 1639
  year: 2019
  ident: 10.1016/j.artint.2022.103685_br0140
  article-title: Explanations for query answers under existential rules
  contributor:
    fullname: Ceylan
– start-page: 228
  year: 2010
  ident: 10.1016/j.artint.2022.103685_br0120
  article-title: Datalog+/-: a family of logical knowledge representation and query languages for new applications
  contributor:
    fullname: Calì
– volume: 10
  start-page: 133
  year: 2008
  ident: 10.1016/j.artint.2022.103685_br0430
  article-title: Linking data to ontologies
  publication-title: J. Data Semant.
  contributor:
    fullname: Poggi
– volume: 193
  start-page: 87
  year: 2012
  ident: 10.1016/j.artint.2022.103685_br0130
  article-title: Towards more expressive ontology languages: the query answering problem
  publication-title: Artif. Intell.
  doi: 10.1016/j.artint.2012.08.002
  contributor:
    fullname: Calì
– start-page: 53
  year: 2013
  ident: 10.1016/j.artint.2022.103685_br0080
  article-title: New inconsistency-tolerant semantics for robust ontology-based data access
  contributor:
    fullname: Bienvenu
– volume: 197
  start-page: 90
  issue: 1–2
  year: 2005
  ident: 10.1016/j.artint.2022.103685_br0160
  article-title: Minimal-change integrity maintenance using tuple deletions
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2004.04.007
  contributor:
    fullname: Chomicki
– volume: 39
  start-page: 299
  issue: 3
  year: 1989
  ident: 10.1016/j.artint.2022.103685_br0260
  article-title: The strong exponential hierarchy collapses
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/0022-0000(89)90025-1
  contributor:
    fullname: Hemachandra
– year: 2019
  ident: 10.1016/j.artint.2022.103685_br0040
  article-title: Inconsistency handling in ontology-mediated query answering: a progress report
  contributor:
    fullname: Bienvenu
– volume: 33
  start-page: 374
  issue: 3
  year: 2001
  ident: 10.1016/j.artint.2022.103685_br0170
  article-title: Complexity and expressive power of logic programming
  publication-title: ACM Comput. Surv.
  doi: 10.1145/502807.502810
  contributor:
    fullname: Dantsin
– start-page: 68
  year: 1999
  ident: 10.1016/j.artint.2022.103685_br0010
  article-title: Consistent query answers in inconsistent databases
  contributor:
    fullname: Arenas
– volume: 175
  start-page: 1877
  issue: 12–13
  year: 2011
  ident: 10.1016/j.artint.2022.103685_br0250
  article-title: On the complexity of core, kernel, and bargaining set
  publication-title: Artif. Intell.
  doi: 10.1016/j.artint.2011.06.002
  contributor:
    fullname: Greco
– start-page: 268
  year: 2014
  ident: 10.1016/j.artint.2022.103685_br0230
  article-title: Polynomial combined rewritings for existential rules
  contributor:
    fullname: Gottlob
– start-page: 488
  year: 2013
  ident: 10.1016/j.artint.2022.103685_br0400
  article-title: Complexity of inconsistency-tolerant query answering in Datalog+/-
  contributor:
    fullname: Lukasiewicz
– volume: 336
  start-page: 89
  issue: 1
  year: 2005
  ident: 10.1016/j.artint.2022.103685_br0210
  article-title: Data exchange: semantics and query answering
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2004.10.033
  contributor:
    fullname: Fagin
– start-page: 155
  year: 2011
  ident: 10.1016/j.artint.2022.103685_br0290
  article-title: Query rewriting for inconsistent dl-lite ontologies
  contributor:
    fullname: Lembo
– volume: 39
  issue: 3
  year: 2014
  ident: 10.1016/j.artint.2022.103685_br0240
  article-title: Query rewriting and optimization for ontological databases
  publication-title: ACM Trans. Database Syst.
  doi: 10.1145/2638546
  contributor:
    fullname: Gottlob
– start-page: 73
  year: 1981
  ident: 10.1016/j.artint.2022.103685_br0020
  article-title: The implication problem for data dependencies
  contributor:
    fullname: Beeri
– start-page: 149
  year: 2008
  ident: 10.1016/j.artint.2022.103685_br0190
  article-title: The chase revisited
  contributor:
    fullname: Deutsch
SSID ssj0003991
Score 2.4958694
Snippet Querying inconsistent knowledge bases is an intriguing problem that gave rise to a flourishing research activity in the knowledge representation and reasoning...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Publisher
StartPage 103685
SubjectTerms Complexity
Computational complexity
Conjunctive queries
Inconsistency
Intersections
Knowledge bases (artificial intelligence)
Knowledge representation
Ontology
Query answering
Relational data bases
Rule-based ontologies
Semantics
Title Inconsistency-tolerant query answering for existential rules
URI https://dx.doi.org/10.1016/j.artint.2022.103685
https://www.proquest.com/docview/2703039790/abstract/
Volume 307
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB76uHjxLdZHycHr2nR3s0nASymWqtCThd6WfSRQKW1pU6QXf7s7yUZQBMFjAjuEL5lvZsg3MwB3ClvQjDVEcSsIpzYlSlNNhFZp5sogQbNSbTER4yl_nkWzBgzrXhiUVXrurzi9ZGt_p-fR7K3nc-zxxbk8WLCgW0ezJrRdOOK8Be3B08t48kXILgb7xXmc4IG6g66UeZXN-iiqpBQb0AUuVf49Qv3g6jIAjY7h0GeOwaB6uBNoZMtTOKq3MgTeSc_gwbk8ql63mA3vSbFaZC4eFYEzutkHLjK9l9MHA5etBjgHs0C9kDO82S2y7TlMR4-vwzHxOxKIYYwXjqtCkdpEU2qZMVxb0c9jhSNvqNAi1ym3aWp4alyaEibaRoozFUVx7uogY1XMLqC1XC2zSwgsC7kRueEhs5yqMDEqYkaJRMUmthHrAKlxketqFIasNWJvssJRIo6ywrEDcQ2e_PZKpWPrP07e1FhL71JbSZGb8C9kePVvw9dwgFeV1OsGWsVml926pKLQXWjef_S7_tP5BKuFzG4
link.rule.ids 315,786,790,4521,24144,27957,27958,45620,45714
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1La8JAEB6sHtpL36X2mUOvi3F3szHQi0hFq_Wk4G3ZRwSLqGik-O-7k2wKLYVCrwk7hC-Zb2bINzMATwpb0Iw1RHErCKc2IUpTTYRWSerKIEHTXG0xEr0Jf51G0wp0yl4YlFV67i84PWdrf6Xh0Wys53Ps8cW5PFiwoFtH0wOo8Shu8irU2v1Bb_RFyC4G-8V5nOCBsoMul3nlzfooqqQUG9AFLlX-PUL94Oo8AHVP4dhnjkG7eLgzqKTLczgptzIE3kkv4Nm5PKpet5gN70m2WqQuHmWBM7rZBy4yfeTTBwOXrQY4BzNDvZAzvNkt0u0lTLov406P-B0JxDDGM8dVoUhsS1NqmTFcW9GcxQpH3lChxUwn3CaJ4YlxaUrY0jZSnKkoimeuDjJWxewKqsvVMr2GwLKQGzEzPGSWUxW2jIqYUaKlYhPbiNWBlLjIdTEKQ5YasXdZ4CgRR1ngWIe4BE9-e6XSsfUfJ-9KrKV3qa2kyE34FzK8-bfhRzjsjd-GctgfDW7hCO8Usq87qGabXXrvEoxMP_gP6BOdK85g
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Inconsistency-tolerant+query+answering+for+existential+rules&rft.jtitle=Artificial+intelligence&rft.au=Lukasiewicz%2C+Thomas&rft.au=Malizia%2C+Enrico&rft.au=Martinez%2C+Maria+Vanina&rft.au=Molinaro%2C+Cristian&rft.date=2022-06-01&rft.issn=0004-3702&rft.volume=307&rft.spage=103685&rft_id=info:doi/10.1016%2Fj.artint.2022.103685&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_artint_2022_103685
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon