Approximately counting answers to conjunctive queries with disequalities and negations

Approximately counting answers to conjunctive queries with disequalities and negations

अन्य संस्करण दिखाएं (1)

<p>We study the complexity of approximating the number of answers to a small query 𝜑 in a large database D. We establish an exhaustive classification into tractable and intractable cases if 𝜑 is a conjunctive query possibly including disequalities and negations:</p> <br> <p>•...

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखकों:	Focke, J, Goldberg, L, Roth, M, Zivny, S
स्वरूप:	Journal article
भाषा:	English
प्रकाशित:	Association for Computing Machinery 2024

समान संसाधन

Approximately counting answers to conjunctive queries with disequalities and negations
द्वारा: Focke, J, और अन्य
प्रकाशित: (2022)

Counting answers to unions of conjunctive queries: natural tractability criteria and meta-complexity
द्वारा: Focke, J, और अन्य
प्रकाशित: (2024)

The complexity of approximately counting retractions
द्वारा: Focke, J, और अन्य
प्रकाशित: (2019)

The complexity of approximately counting retractions
द्वारा: Focke, J, और अन्य
प्रकाशित: (2020)

The complexity of approximately counting retractions to square-free graphs
द्वारा: Focke, J, और अन्य
प्रकाशित: (2021)

The Weisfeiler-Leman dimension of conjunctive queries
द्वारा: Göbel, A, और अन्य
प्रकाशित: (2024)

Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies.
द्वारा: Gottlob, G, और अन्य
प्रकाशित: (2011)

Conjunctive query answering for the description logic SHIQ
द्वारा: Glimm, B, और अन्य
प्रकाशित: (2008)

Conjunctive Query Answering for the Description Logic SHIQ
द्वारा: Glimm, B, और अन्य
प्रकाशित: (2008)

Conjunctive Query Answering in Probabilistic Datalog+⁄− Ontologies
द्वारा: Gottlob, G, और अन्य
प्रकाशित: (2011)

Conjunctive Query Answering in the Description Logic SHIQ
द्वारा: Glimm, B, और अन्य
प्रकाशित: (2007)

Conjunctive Query Answering in the Description Logic SHIQ
द्वारा: Glimm, B, और अन्य
प्रकाशित: (2006)

Counting homomorphisms to K4-minor-free graphs, modulo 2
द्वारा: Focke, J, और अन्य
प्रकाशित: (2021)

Nominals‚ Inverses‚ Counting‚ and Conjunctive Queries
द्वारा: Rudolph, S, और अन्य
प्रकाशित: (2010)

Counting homomorphisms to K4-minor-free graphs, modulo 2
द्वारा: Focke, J, और अन्य
प्रकाशित: (2021)

Conjunctive Query Answering for Description Logics with Transitive Roles
द्वारा: Glimm, B, और अन्य
प्रकाशित: (2006)

The complexity of counting surjective homomorphisms and compactions
द्वारा: Focke, J, और अन्य
प्रकाशित: (2017)

The complexity of counting surjective homomorphisms and compactions
द्वारा: Focke, J, और अन्य
प्रकाशित: (2019)

Conjunctive query answering over unrestricted OWL 2 ontologies
द्वारा: Igne, F, और अन्य
प्रकाशित: (2023)

Conjunctive query answering over unrestricted OWL 2 ontologies
द्वारा: Igne, F
प्रकाशित: (2022)

Boolean tensor decomposition for conjunctive queries with negation
द्वारा: Abo Khamis, M, और अन्य
प्रकाशित: (2019)

Bounds for the query complexity of approximate equilibria
द्वारा: Goldberg, PW, और अन्य
प्रकाशित: (2016)

OLAP Techniques for Approximation and Mining Query Answering
द्वारा: Murtadaha Hamd, और अन्य
प्रकाशित: (2010-12-01)

Tractability beyond β-acyclicity for conjunctive queries with negation
द्वारा: Lanzinger, M
प्रकाशित: (2021)

Answering conjunctive queries over EL knowledge bases with transitive and reflexive roles
द्वारा: Stefanoni, G, और अन्य
प्रकाशित: (2015)

The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
द्वारा: Stefanoni, G, और अन्य
प्रकाशित: (2014)

Complexity of approximate query answering under inconsistency in datalog+/-
द्वारा: Lukasiewicz, T, और अन्य
प्रकाशित: (2018)

Complexity of approximate query answering under inconsistency in Datalog+/-
द्वारा: Lukasiewicz, T, और अन्य
प्रकाशित: (2018)

Nominals‚ Inverses‚ Counting‚ and Conjunctive Queries or Why Infinity is your Friend!
द्वारा: Glimm, B, और अन्य
प्रकाशित: (2009)

Complexity of answering counting aggregate queries over DL-Lite
द्वारा: Kostylev, E, और अन्य
प्रकाशित: (2013)

Complexity of answering counting aggregate queries over DL - Lite
द्वारा: Kostylev, E, और अन्य
प्रकाशित: (2015)

Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
द्वारा: Sherkhonov, E, और अन्य
प्रकाशित: (2016)

The Hidden Disequities of Carbon Trading: Carbon Emissions, Air Toxics, and Environmental Justice
द्वारा: Raul P. Lejano, और अन्य
प्रकाशित: (2020-11-01)

Tractability beyond β-acyclicity for conjunctive queries with negation and SAT
द्वारा: Lanzinger, MP
प्रकाशित: (2022)

The Complexity of Explaining Negative Query Answers in DL−Lite
द्वारा: Calvanese, D, और अन्य
प्रकाशित: (2012)

Answering counting aggregate queries over ontologies of the DL-Lite family
द्वारा: Kostylev, E, और अन्य
प्रकाशित: (2013)

Explanations for negative query answers under existential rules
द्वारा: Ceylan, I, और अन्य
प्रकाशित: (2020)

Conjunctive queries with negation over DL-Lite: A closer look
द्वारा: Gutiérrez-Basulto, V, और अन्य
प्रकाशित: (2013)

Semantic optimization of conjunctive queries
द्वारा: Barcelo, P, और अन्य
प्रकाशित: (2020)

Handling Cyclic Conjunctive Queries
द्वारा: Glimm, B, और अन्य
प्रकाशित: (2005)