Tractable Lineages on Treelike Instances: Limits and Extensions
|
|
- Felicity Parks
- 6 years ago
- Views:
Transcription
1 Tractable Lineages on Treelike Instances: Limits and Extensions Antoine Amarilli 1, Pierre Bourhis 2, Pierre enellart 1,3 June 29th, Télécom ParisTech 2 CNR CRItAL 3 National University of ingapore 1/20
2 Tuple independent databases (TID) Probabilistic databases: model uncertainty about data implest model: tuple independent databases (TID) A relational database I A probability valuation π mapping each fact of I to [0, 1] emantics of a TID (I, π): a probability distribution on I I: Each fact F I is either present or absent with probability π(f) Assume independence across facts 2/20
3 Example: TID a a 1 b v.5 b w.2 3/20
4 Example: TID a a 1 b v.5 b w.2 This TID (I, π) represents the following probability distribution: 3/20
5 Example: TID a a 1 b v.5 b w.2 This TID (I, π) represents the following probability distribution:.5.2 a b b a v w 3/20
6 Example: TID a a 1 b v.5 b w.2 This TID (I, π) represents the following probability distribution: (1.2) a a a a b v b v b w 3/20
7 Example: TID a a 1 b v.5 b w.2 This TID (I, π) represents the following probability distribution: (1.2) (1.5).2 a a a a a a b v b v b w b w 3/20
8 Example: TID a a 1 b v.5 b w.2 This TID (I, π) represents the following probability distribution: (1.2) (1.5).2 (1.5) (1.2) a a a a a a a a b v b v b w b w 3/20
9 Probabilistic query evaluation (PQE) Let us fix: Relational signature σ Class I of relational instances on σ (e.g., acyclic, treelike) Class Q of Boolean queries (e.g., CQs, acyclic CQs) 4/20
10 Probabilistic query evaluation (PQE) Let us fix: Relational signature σ Class I of relational instances on σ (e.g., acyclic, treelike) Class Q of Boolean queries (e.g., CQs, acyclic CQs) Probabilistic query evaluation (PQE) problem for Q and I: Fix a query q Q Read an instance I I and a probability valuation π Compute the probability that (I, π) satisfies q Data complexity: measured as a function of (I, π) 4/20
11 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. 5/20
12 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) 5/20
13 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 5/20
14 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 5/20
15 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 5/20
16 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 5/20
17 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 5/20
18 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 The query is true iff R(b) is here and one of: 5/20
19 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 The query is true iff R(b) is here and one of: (b, v) and T(v) are here 5/20
20 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 The query is true iff R(b) is here and one of: (b, v) and T(v) are here (b, w) and T(w) are here 5/20
21 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 The query is true iff R(b) is here and one of: (b, v) and T(v) are here (b, w) and T(w) are here Probability: 5/20
22 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 The query is true iff R(b) is here and one of: (b, v) and T(v) are here (b, w) and T(w) are here Probability:.4 5/20
23 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 The query is true iff R(b) is here and one of: (b, v) and T(v) are here (b, w) and T(w) are here Probability:.4 (1 5/20
24 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 The query is true iff R(b) is here and one of: (b, v) and T(v) are here (b, w) and T(w) are here Probability:.4 (1 (1.5.3) 5/20
25 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 The query is true iff R(b) is here and one of: (b, v) and T(v) are here (b, w) and T(w) are here Probability:.4 (1 (1.5.3) (1.2.7)) 5/20
26 Example: PQE ignature σ, class Q of conjunctive queries, class I of all instances. q : x y R(x) (x, y) T(y) R a 1 b.4 c.6 a a 1 b v.5 b w.2 T v.3 w.7 b 1 The query is true iff R(b) is here and one of: (b, v) and T(v) are here (b, w) and T(w) are here Probability:.4 (1 (1.5.3) (1.2.7)) = /20
27 Complexity of probabilistic query evaluation (PQE) Question: what is the complexity of PQE depending on the class Q of queries and class I of instances? 6/20
28 Complexity of probabilistic query evaluation (PQE) Question: what is the complexity of PQE depending on the class Q of queries and class I of instances? Existing dichotomy result on Q [Dalvi and uciu, 2012] Q are unions of CQs, I is all instances There is a class Q of safe queries 6/20
29 Complexity of probabilistic query evaluation (PQE) Question: what is the complexity of PQE depending on the class Q of queries and class I of instances? Existing dichotomy result on Q [Dalvi and uciu, 2012] Q are unions of CQs, I is all instances There is a class Q of safe queries PQE is PTIME for any q on all instances 6/20
30 Complexity of probabilistic query evaluation (PQE) Question: what is the complexity of PQE depending on the class Q of queries and class I of instances? Existing dichotomy result on Q [Dalvi and uciu, 2012] Q are unions of CQs, I is all instances There is a class Q of safe queries PQE is PTIME for any q on all instances PQE is #P-hard for any q Q\ on all instances 6/20
31 Complexity of probabilistic query evaluation (PQE) Question: what is the complexity of PQE depending on the class Q of queries and class I of instances? Existing dichotomy result on Q [Dalvi and uciu, 2012] Q are unions of CQs, I is all instances There is a class Q of safe queries PQE is PTIME for any q on all instances PQE is #P-hard for any q Q\ on all instances q : x y R(x) (x, y) T(y) is unsafe! 6/20
32 Instance-based dichotomy We show a dichotomy result on I instead: Q are Boolean monadic second-order queries (includes all UCQs) 7/20
33 Instance-based dichotomy We show a dichotomy result on I instead: Q are Boolean monadic second-order queries (includes all UCQs) PQE is in linear time for Q on any bounded-treewidth class I up to arithmetic costs [ame authors, ICALP 15] 7/20
34 Instance-based dichotomy We show a dichotomy result on I instead: Q are Boolean monadic second-order queries (includes all UCQs) PQE is in linear time for Q on any bounded-treewidth class I up to arithmetic costs [ame authors, ICALP 15] This talk: PQE is intractable for Q on any unbounded-treewidth class I (under some assumptions) 7/20
35 Instance-based dichotomy We show a dichotomy result on I instead: Q are Boolean monadic second-order queries (includes all UCQs) PQE is in linear time for Q on any bounded-treewidth class I up to arithmetic costs [ame authors, ICALP 15] This talk: PQE is intractable for Q on any unbounded-treewidth class I (under some assumptions) Treewidth measures how much data is close to a tree Trees have treewidth 1 Cycles have treewidth 2 k-cliques and (k 1)-grids have treewidth k 1 7/20
36 Main result: hardness of PQE Theorem For any arity-2 signature σ, there is a first-order query q such that for any constructible unbounded-treewidth class I, the PQE problem for Q = {q} and I is #P-hard under RP reductions Arity-2: Relations have arity 2 (and one has arity 2), i.e., graphs Unbounded-treewidth: for all k N, there is I k I of treewidth k Constructible: given k, we can compute such an instance I k in PTIME #P-hard under RP reductions: reduce in PTIME with high probability from the problem of counting accepting paths of a PTIME machine 8/20
37 Table of contents Introduction Proof sketch Extensions Conclusion 9/20
38 Idea: Topological minors G is a topological minor of H if: 10/20
39 Idea: Topological minors G is a topological minor of H if: G H 10/20
40 Idea: Topological minors G is a topological minor of H if: 1 3 G 2 Embedding: maps edges to vertex-disjoint paths maps vertices to vertices H /20
41 Topological minor extraction results Theorem [Robertson and eymour, 1986] For any planar graph G of degree 3, for any graph H of sufficiently high treewidth, G is a topological minor of H. 11/20
42 Topological minor extraction results Theorem [Robertson and eymour, 1986] For any planar graph G of degree 3, for any graph H of sufficiently high treewidth, G is a topological minor of H. More recently: Theorem [Chekuri and Chuzhoy, 2014] There is a certain constant c N such that for any planar graph G of degree 3 and graph H of treewidth G c, we can embed G as a topological minor of H in PTIME with high proba 11/20
43 Proof sketch Choose a problem from which to reduce: Must be #P-hard on planar degree-3 graphs Must be encodable to an FO query q We use the problem of counting graph matchings 12/20
44 Proof sketch Choose a problem from which to reduce: Must be #P-hard on planar degree-3 graphs Must be encodable to an FO query q We use the problem of counting graph matchings Given an input graph G, compute k = G c 12/20
45 Proof sketch Choose a problem from which to reduce: Must be #P-hard on planar degree-3 graphs Must be encodable to an FO query q We use the problem of counting graph matchings Given an input graph G, compute k = G c Compute in PTIME an instance I k of I of treewidth k 12/20
46 Proof sketch Choose a problem from which to reduce: Must be #P-hard on planar degree-3 graphs Must be encodable to an FO query q We use the problem of counting graph matchings Given an input graph G, compute k = G c Compute in PTIME an instance I k of I of treewidth k Compute in randomized PTIME an embedding of G in I k 12/20
47 Proof sketch Choose a problem from which to reduce: Must be #P-hard on planar degree-3 graphs Must be encodable to an FO query q We use the problem of counting graph matchings Given an input graph G, compute k = G c Compute in PTIME an instance I k of I of treewidth k Compute in randomized PTIME an embedding of G in I k Construct a probability valuation π of I k such that: Unneccessary edges of I k are removed PQE for q gives the answer to the hard problem Easy for MO but trickier for FO 12/20
48 Table of contents Introduction Proof sketch Extensions Conclusion 13/20
49 Non-probabilistic evaluation Apply [Chekuri and Chuzhoy, 2014] to method of [Ganian et al., 2014] for MO non-probabilistic query evaluation (QE): Theorem For any arity-2 signature σ and level Σ P i of the polynomial hierarchy, there is a MO query q i such that, for any constructible, subinstance-closed, unbounded-tw class I, the QE problem for Q = {q i } and I is Σ P i -hard under RP reductions 14/20
50 Non-probabilistic evaluation Apply [Chekuri and Chuzhoy, 2014] to method of [Ganian et al., 2014] for MO non-probabilistic query evaluation (QE): Theorem For any arity-2 signature σ and level Σ P i of the polynomial hierarchy, there is a MO query q i such that, for any constructible, subinstance-closed, unbounded-tw class I, the QE problem for Q = {q i } and I is Σ P i -hard under RP reductions Variant: we also show a result like in [Ganian et al., 2014], with: weaker constructibility requirement on I: I is densely unbounded poly-logarithmically stronger complexity hypothesis: PH does not admit 2 o(n) -sized circuits 14/20
51 Lower bound on OBDD representations OBDD for a query q on instance I: ordered decision diagram on the facts of I to decide whether q holds 15/20
52 Lower bound on OBDD representations OBDD for a query q on instance I: ordered decision diagram on the facts of I to decide whether q holds q : x y R(x) (x, y) T(y) R a r 1 b r 2 c r 3 a a s 1 b v s 2 b w s 3 T v t 1 w t 2 b t 3 15/20
53 Lower bound on OBDD representations OBDD for a query q on instance I: ordered decision diagram on the facts of I to decide whether q holds q : x y R(x) (x, y) T(y) r 2? 1... R a r 1 a a s 1 T v t 1 0 b r 2 b v s 2 w t 2 c r 3 b w s 3 b t 3 0
54 Lower bound on OBDD representations OBDD for a query q on instance I: ordered decision diagram on the facts of I to decide whether q holds q : x y R(x) (x, y) T(y) R T a r 1 a a s 1 v t 1 b r 2 b v s 2 w t 2 0 r 2? 1 s 2? c r 3 b w s 3 b t 3 0
55 Lower bound on OBDD representations OBDD for a query q on instance I: ordered decision diagram on the facts of I to decide whether q holds q : x y R(x) (x, y) T(y) R T a r 1 a a s 1 v t 1 b r 2 b v s 2 w t 2 c r 3 b w s 3 b t 3 0 r 2? 1 s 2? t 1? 1 0 1
56 Lower bound on OBDD representations OBDD for a query q on instance I: ordered decision diagram on the facts of I to decide whether q holds q : x y R(x) (x, y) T(y) R T a r 1 a a s 1 v t 1 b r 2 b v s 2 w t 2 c r 3 b w s 3 b t r 2? 1 s 2? 0 0 s 3? 1 t 1?
57 Lower bound on OBDD representations OBDD for a query q on instance I: ordered decision diagram on the facts of I to decide whether q holds q : x y R(x) (x, y) T(y) R T a r 1 a a s 1 v t 1 b r 2 b v s 2 w t 2 c r 3 b w s 3 b t r 2? 1 s 2? 1 0 t 1? 0 s 3? t 2? /20
58 Lower bound on OBDD representations (result) If we find an OBDD of q on I in PTIME, then PQE of q on I also is how inexistence of poly-size OBDDs (rather than PQE hardness) 16/20
59 Lower bound on OBDD representations (result) If we find an OBDD of q on I in PTIME, then PQE of q on I also is how inexistence of poly-size OBDDs (rather than PQE hardness) Theorem For any arity-2 signature σ, there is a UCQ with inequalities q s.t. for any I of treewidth densely unbounded poly-logarithmically, q has no OBDDs of polynomial size on instances of I 16/20
60 Lower bound on OBDD representations (result) If we find an OBDD of q on I in PTIME, then PQE of q on I also is how inexistence of poly-size OBDDs (rather than PQE hardness) Theorem For any arity-2 signature σ, there is a UCQ with inequalities q s.t. for any I of treewidth densely unbounded poly-logarithmically, q has no OBDDs of polynomial size on instances of I Meta-dichotomy on the connected UCQ for which this holds 16/20
61 Also in paper Hardness results for MO match counting: Count how many subsets X are such that I satisfies q(x) Connect the tractability result of MO on treelike TID to the study of tractable lineages: d-dnnfs, OBDDs, formulae, etc. Connect the same result to tractability of safe queries: Inversion-free queries: subclass of safe queries, tractable OBDDs We can always rewrite their input instances to treelike instances in a lineage-preserving way (hence, probability-preserving) 17/20
62 Table of contents Introduction Proof sketch Extensions Conclusion 18/20
63 ummary of our dichotomy Upper. PQE for MO on treelike instances has linear data complexity up to arithmetic costs 19/20
64 ummary of our dichotomy Upper. PQE for MO on treelike instances has linear data complexity up to arithmetic costs Lower. PQE for FO on any constructible, arity-2, unbounded-tw instance family is #P-hard under RP reductions 19/20
65 ummary of our dichotomy Upper. PQE for MO on treelike instances has linear data complexity up to arithmetic costs Lower. PQE for FO on any constructible, arity-2, unbounded-tw instance family is #P-hard under RP reductions Bounded treewidth is the right notion for tractability of PQE 19/20
66 Future work Can we show #P-hardness under usual P reductions? Depends on [Chekuri and Chuzhoy, 2014] 20/20
67 Future work Can we show #P-hardness under usual P reductions? Depends on [Chekuri and Chuzhoy, 2014] Can we extend the result to arbitrary arity signatures? 20/20
68 Future work Can we show #P-hardness under usual P reductions? Depends on [Chekuri and Chuzhoy, 2014] Can we extend the result to arbitrary arity signatures? Can we extend the result to weaker query languages like UCQ? Conjecture PQE is hard on any constructible unbounded-tw family for: q : (E(x, y) E(y, x)) (E(y, z) E(z, y)) x z This query is alerady hard in terms of OBDDs 20/20
69 Future work Can we show #P-hardness under usual P reductions? Depends on [Chekuri and Chuzhoy, 2014] Can we extend the result to arbitrary arity signatures? Can we extend the result to weaker query languages like UCQ? Conjecture PQE is hard on any constructible unbounded-tw family for: q : (E(x, y) E(y, x)) (E(y, z) E(z, y)) x z This query is alerady hard in terms of OBDDs Thanks for your attention! 20/20
70 References I Amarilli, A., Bourhis, P., and enellart, P. (2015). Provenance circuits for trees and treelike instances. In Proc. ICALP, LNC, pages Chaudhuri,. and Vardi, M. Y. (1992). On the equivalence of recursive and nonrecursive Datalog programs. In POD. Chekuri, C. and Chuzhoy, J. (2014). Polynomial bounds for the grid-minor theorem. In TOC.
71 References II Dalvi, N. and uciu, D. (2012). The dichotomy of probabilistic inference for unions of conjunctive queries. JACM, 59(6):30. Ganian, R., Hliněnỳ, P., Langer, A., Obdržálek, J., Rossmanith, P., and ikdar,. (2014). Lower bounds on the complexity of MO1 model-checking. JC, 1(80). Robertson, N. and eymour, P. D. (1986). Graph minors. V. Excluding a planar graph. J. Comb. Theory, er. B, 41(1).
72 Encoding treelike instances [Chaudhuri and Vardi, 1992] Instance: N a b c d e b c d e f a b c e
73 Encoding treelike instances [Chaudhuri and Vardi, 1992] Instance: Gaifman graph: N a f a b b c c d b e d e e f c d a b c e
74 Encoding treelike instances [Chaudhuri and Vardi, 1992] Instance: Gaifman graph: Tree decomp.: N a f a b c a b c d e b c d e f b c e d c d e b c e e f a b c e
75 Encoding treelike instances [Chaudhuri and Vardi, 1992] Instance: Gaifman graph: Tree decomp.: Tree encoding: N a f a b c N(a 1, a 2 ) a b c d e b c d e f b c e d c d e b c e e f N(a 2, a 3 ) (a 1, a 3 ) (a 2, a 4 ) N(a 3, a 1 ) N(a 4, a 1 ) a b c e N(a 1, a 4 )
76 Defining the query G I k In the embedding, edges of G can become long paths in I k q must answer the hard problem on G despite subdivisions Easy in MO but tricky in FO!
77 Defining the query G I k In the embedding, edges of G can become long paths in I k q must answer the hard problem on G despite subdivisions Easy in MO but tricky in FO! Our q restricts to a subset of the worlds of known weight and gives the right answer up to renormalization
The Veracity of Big Data
The Veracity of Big Data Pierre Senellart École normale supérieure 13 October 2016, Big Data & Market Insights 23 April 2013, Dow Jones (cnn.com) 23 April 2013, Dow Jones (cnn.com) 23 April 2013, Dow Jones
More informationTowards Deterministic Decomposable Circuits for Safe Queries
Towards Deterministic Decomposable Circuits for Safe Queries Mikaël Monet 1 and Dan Olteanu 2 1 LTCI, Télécom ParisTech, Université Paris-Saclay, France, Inria Paris; Paris, France mikael.monet@telecom-paristech.fr
More informationStructural Tractability of Counting of Solutions to Conjunctive Queries
Structural Tractability of Counting of Solutions to Conjunctive Queries Arnaud Durand 1 1 University Paris Diderot Journées DAG, june 2013 Joint work with Stefan Mengel (JCSS (to appear) + ICDT 2013) 1
More informationEnumeration: logical and algebraic approach
Enumeration: logical and algebraic approach Yann Strozecki Université Paris Sud - Paris 11 Novembre 2011, séminaire ALGO/LIX Introduction to Enumeration Enumeration and logic Enumeration and polynomials
More informationFinite Model Theory: First-Order Logic on the Class of Finite Models
1 Finite Model Theory: First-Order Logic on the Class of Finite Models Anuj Dawar University of Cambridge Modnet Tutorial, La Roche, 21 April 2008 2 Finite Model Theory In the 1980s, the term finite model
More informationA Dichotomy. in in Probabilistic Databases. Joint work with Robert Fink. for Non-Repeating Queries with Negation Queries with Negation
Dichotomy for Non-Repeating Queries with Negation Queries with Negation in in Probabilistic Databases Robert Dan Olteanu Fink and Dan Olteanu Joint work with Robert Fink Uncertainty in Computation Simons
More informationFinite and Algorithmic Model Theory II: Automata-Based Methods
Finite and Algorithmic Model Theory II: Automata-Based Methods Anuj Dawar University of Cambridge Computer Laboratory Simons Institute, 30 August 2016 Review We aim to develop tools for studying the expressive
More informationOutline. Part 1: Motivation Part 2: Probabilistic Databases Part 3: Weighted Model Counting Part 4: Lifted Inference for WFOMC
Outline Part 1: Motivation Part 2: Probabilistic Databases Part 3: Weighted Model Counting Part 4: Lifted Inference for WFOMC Part 5: Completeness of Lifted Inference Part 6: Query Compilation Part 7:
More informationKernelization Lower Bounds: A Brief History
Kernelization Lower Bounds: A Brief History G Philip Max Planck Institute for Informatics, Saarbrücken, Germany New Developments in Exact Algorithms and Lower Bounds. Pre-FSTTCS 2014 Workshop, IIT Delhi
More informationTree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationTractable Counting of the Answers to Conjunctive Queries
Tractable Counting of the Answers to Conjunctive Queries Reinhard Pichler and Sebastian Skritek Technische Universität Wien, {pichler, skritek}@dbai.tuwien.ac.at Abstract. Conjunctive queries (CQs) are
More informationComputing Query Probability with Incidence Algebras Technical Report UW-CSE University of Washington
Computing Query Probability with Incidence Algebras Technical Report UW-CSE-10-03-02 University of Washington Nilesh Dalvi, Karl Schnaitter and Dan Suciu Revised: August 24, 2010 Abstract We describe an
More informationThe complexity of enumeration and counting for acyclic conjunctive queries
The complexity of enumeration and counting for acyclic conjunctive queries Cambridge, march 2012 Counting and enumeration Counting Output the number of solutions Example : sat, Perfect Matching, Permanent,
More informationBrief Tutorial on Probabilistic Databases
Brief Tutorial on Probabilistic Databases Dan Suciu University of Washington Simons 206 About This Talk Probabilistic databases Tuple-independent Query evaluation Statistical relational models Representation,
More informationA Trichotomy in the Complexity of Counting Answers to Conjunctive Queries
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries Hubie Chen Stefan Mengel August 5, 2014 Conjunctive queries are basic and heavily studied database queries; in relational algebra,
More informationModel Checking Lower Bounds for Simple Graphs. Michael Lampis KTH Royal Institute of Technology
Model Checking Lower Bounds for Simple Graphs Michael Lampis KTH Royal Institute of Technology March 11, 2013 Algorithmic Meta-Theorems Positive results Problem X is tractable. Negative results Problem
More informationNP Completeness. Richard Karp, 1972.
NP Completeness In this paper we give theorems that suggest, but do not imply, that these problems as well as many others, will remain intractable perpetually. Richard Karp, 1972. Reductions At the heart
More informationDatalog and Constraint Satisfaction with Infinite Templates
Datalog and Constraint Satisfaction with Infinite Templates Manuel Bodirsky 1 and Víctor Dalmau 2 1 CNRS/LIX, École Polytechnique, bodirsky@lix.polytechnique.fr 2 Universitat Pompeu Fabra, victor.dalmau@upf.edu
More informationLogic and Databases. Phokion G. Kolaitis. UC Santa Cruz & IBM Research Almaden. Lecture 4 Part 1
Logic and Databases Phokion G. Kolaitis UC Santa Cruz & IBM Research Almaden Lecture 4 Part 1 1 Thematic Roadmap Logic and Database Query Languages Relational Algebra and Relational Calculus Conjunctive
More informationarxiv: v1 [cs.db] 21 Feb 2017
Answering Conjunctive Queries under Updates Christoph Berkholz, Jens Keppeler, Nicole Schweikardt Humboldt-Universität zu Berlin {berkholz,keppelej,schweika}@informatik.hu-berlin.de February 22, 207 arxiv:702.06370v
More informationOn the Succinctness of Query Rewriting for Datalog
On the Succinctness of Query Rewriting for Datalog Shqiponja Ahmetaj 1 Andreas Pieris 2 1 Institute of Logic and Computation, TU Wien, Austria 2 School of Informatics, University of Edinburgh, UK Foundational
More information1 First-order logic. 1 Syntax of first-order logic. 2 Semantics of first-order logic. 3 First-order logic queries. 2 First-order query evaluation
Knowledge Bases and Databases Part 1: First-Order Queries Diego Calvanese Faculty of Computer Science Master of Science in Computer Science A.Y. 2007/2008 Overview of Part 1: First-order queries 1 First-order
More informationBounded Query Rewriting Using Views
Bounded Query Rewriting Using Views Yang Cao 1,3 Wenfei Fan 1,3 Floris Geerts 2 Ping Lu 3 1 University of Edinburgh 2 University of Antwerp 3 Beihang University {wenfei@inf, Y.Cao-17@sms}.ed.ac.uk, floris.geerts@uantwerpen.be,
More informationDichotomies in Ontology-Mediated Querying with the Guarded Fragment
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment eating these from the CONP-hard cases. This question and related ones have given rise to a considerable array of ontology languages,
More informationEnumeration Complexity of Conjunctive Queries with Functional Dependencies
Enumeration Complexity of Conjunctive Queries with Functional Dependencies Nofar Carmeli Technion, Haifa, Israel snofca@cs.technion.ac.il Markus Kröll TU Wien, Vienna, Austria kroell@dbai.tuwien.ac.at
More informationAlgorithmic Meta-Theorems
Algorithmic Meta-Theorems Stephan Kreutzer Oxford University Computing Laboratory stephan.kreutzer@comlab.ox.ac.uk Abstract. Algorithmic meta-theorems are general algorithmic results applying to a whole
More informationKnowledge Compilation Meets Database Theory : Compiling Queries to Decision Diagrams
Knowledge Compilation Meets Database Theory : Compiling Queries to Decision Diagrams Abhay Jha Computer Science and Engineering University of Washington, WA, USA abhaykj@cs.washington.edu Dan Suciu Computer
More informationA Toolbox of Query Evaluation Techniques for Probabilistic Databases
2nd Workshop on Management and mining Of UNcertain Data (MOUND) Long Beach, March 1st, 2010 A Toolbox of Query Evaluation Techniques for Probabilistic Databases Dan Olteanu, Oxford University Computing
More informationOn Datalog vs. LFP. Anuj Dawar and Stephan Kreutzer
On Datalog vs. LFP Anuj Dawar and Stephan Kreutzer 1 University of Cambridge Computer Lab, anuj.dawar@cl.cam.ac.uk 2 Oxford University Computing Laboratory, kreutzer@comlab.ox.ac.uk Abstract. We show that
More informationLecture 8: Complete Problems for Other Complexity Classes
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 8: Complete Problems for Other Complexity Classes David Mix Barrington and Alexis Maciel
More informationDatabase Theory VU , SS Complexity of Query Evaluation. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2018 5. Complexity of Query Evaluation Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 17 April, 2018 Pichler
More informationDatalog : A Family of Languages for Ontology Querying
Datalog : A Family of Languages for Ontology Querying Georg Gottlob Department of Computer Science University of Oxford joint work with Andrea Calì,Thomas Lukasiewicz, Marco Manna, Andreas Pieris et al.
More informationÖzgür L. Özçep Data Exchange 2
INSTITUT FÜR INFORMATIONSSYSTEME Özgür L. Özçep Data Exchange 2 Lecture 6: Universal Solutions, Core, Certain Answers 23 November, 2016 Foundations of Ontologies and Databases for Information Systems CS5130
More informationOn the Expressive Power of Logics on Finite Models
On the Expressive Power of Logics on Finite Models Phokion G. Kolaitis Computer Science Department University of California, Santa Cruz Santa Cruz, CA 95064, USA kolaitis@cs.ucsc.edu August 1, 2003 Partially
More informationQuery answering using views
Query answering using views General setting: database relations R 1,...,R n. Several views V 1,...,V k are defined as results of queries over the R i s. We have a query Q over R 1,...,R n. Question: Can
More informationComputing Query Probability with Incidence Algebras
Computing Query Probability with Incidence Algebras Nilesh Dalvi Yahoo Research Santa Clara, CA, USA ndalvi@yahoo-inc.com Karl Schnaitter UC Santa Cruz Santa Cruz, CA, USA karlsch@soe.ucsc.edu Dan Suciu
More informationGAV-sound with conjunctive queries
GAV-sound with conjunctive queries Source and global schema as before: source R 1 (A, B),R 2 (B,C) Global schema: T 1 (A, C), T 2 (B,C) GAV mappings become sound: T 1 {x, y, z R 1 (x,y) R 2 (y,z)} T 2
More informationCS Lecture 29 P, NP, and NP-Completeness. k ) for all k. Fall The class P. The class NP
CS 301 - Lecture 29 P, NP, and NP-Completeness Fall 2008 Review Languages and Grammars Alphabets, strings, languages Regular Languages Deterministic Finite and Nondeterministic Automata Equivalence of
More informationConstraint satisfaction problems and dualities
Andrei Krokhin - CSPs and dualities 1 Constraint satisfaction problems and dualities Andrei Krokhin University of Durham Andrei Krokhin - CSPs and dualities 2 The CSP The Constraint Satisfaction (or Homomorphism)
More information1 Circuit Complexity. CS 6743 Lecture 15 1 Fall Definitions
CS 6743 Lecture 15 1 Fall 2007 1 Circuit Complexity 1.1 Definitions A Boolean circuit C on n inputs x 1,..., x n is a directed acyclic graph (DAG) with n nodes of in-degree 0 (the inputs x 1,..., x n ),
More informationEnumerating Homomorphisms
Enumerating Homomorphisms Andrei A. Bulatov School of Computing Science, Simon Fraser University, Burnaby, Canada Víctor Dalmau 1, Department of Information and Communication Technologies, Universitat
More informationScalable Uncertainty Management
Scalable Uncertainty Management 05 Query Evaluation in Probabilistic Databases Rainer Gemulla Jun 1, 2012 Overview In this lecture Primer: relational calculus Understand complexity of query evaluation
More informationComputational Complexity of Bayesian Networks
Computational Complexity of Bayesian Networks UAI, 2015 Complexity theory Many computations on Bayesian networks are NP-hard Meaning (no more, no less) that we cannot hope for poly time algorithms that
More information7 RC Simulates RA. Lemma: For every RA expression E(A 1... A k ) there exists a DRC formula F with F V (F ) = {A 1,..., A k } and
7 RC Simulates RA. We now show that DRC (and hence TRC) is at least as expressive as RA. That is, given an RA expression E that mentions at most C, there is an equivalent DRC expression E that mentions
More informationLocality of queries definable in invariant first-order logic with arbitrary built-in predicates
Locality of queries definable in invariant first-order logic with arbitrary built-in predicates Matthew Anderson 1,, Dieter van Melkebeek 1,, Nicole Schweikardt 2, Luc Segoufin 3 1 University of Wisconsin
More information1. Introduction Recap
1. Introduction Recap 1. Tractable and intractable problems polynomial-boundness: O(n k ) 2. NP-complete problems informal definition 3. Examples of P vs. NP difference may appear only slightly 4. Optimization
More informationarxiv: v3 [math.lo] 26 Apr 2016
Discrete Temporal Constraint Satisfaction Problems arxiv:1503.08572v3 [math.lo] 26 Apr 2016 Manuel Bodirsky Institut für Algebra, TU Dresden, Dresden Barnaby Martin School of Science and Technology, Middlesex
More informationHamiltonicity of automatic graphs
Hamiltonicity of automatic graphs Dietrich Kuske 1 and Markus Lohrey 2 1 Institut für Informatik, Universität Leipzig, kuske@informatik.uni-leipzig.de 2 Institut für Informatik, Universität Leipzig, lohrey@informatik.uni-leipzig.de
More informationNP-Complete problems
NP-Complete problems NP-complete problems (NPC): A subset of NP. If any NP-complete problem can be solved in polynomial time, then every problem in NP has a polynomial time solution. NP-complete languages
More informationComplexity of conditional colorability of graphs
Complexity of conditional colorability of graphs Xueliang Li 1, Xiangmei Yao 1, Wenli Zhou 1 and Hajo Broersma 2 1 Center for Combinatorics and LPMC-TJKLC, Nankai University Tianjin 300071, P.R. China.
More informationLecture 59 : Instance Compression and Succinct PCP s for NP
IITM-CS6840: Advanced Complexity Theory March 31, 2012 Lecture 59 : Instance Compression and Succinct PCP s for NP Lecturer: Sivaramakrishnan N.R. Scribe: Prashant Vasudevan 1 Introduction Classical Complexity
More informationOn the Relationship between Consistent Query Answering and Constraint Satisfaction Problems
On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems Carsten Lutz 1 and Frank Wolter 2 1 Fachbereich Informatik, Universität Bremen, Germany clu@uni-bremen.de 2 Department
More informationCV-width: A New Complexity Parameter for CNFs
CV-width: A New Complexity Parameter for CNFs Umut Oztok and Adnan Darwiche 1 Abstract. We present new complexity results on the compilation of CNFs into DNNFs and OBDDs. In particular, we introduce a
More informationCaterpillar duality for CSP. C. Carvalho (UoD), V. Dalmau (UPF) and A. Krokhin (UoD)
Caterpillar duality for CSP C. Carvalho (UoD), V. Dalmau (UPF) and A. Krokhin (UoD) Motivation The following problems Scheduling; System of linear equations; Drawing up a timetable; Check the satisfiability
More informationFrom Conjunctive Queries to SPARQL Queries in Ontology-Mediated Querying
From Conjunctive Queries to SPARQL Queries in Ontology-Mediated Querying Cristina Feier 1, Carsten Lutz 1, and Frank Wolter 2 1 University of Bremen, Germany feier@uni-bremen.de clu@uni-bremen.de 2 University
More informationComplexity of Inference in Graphical Models
Complexity of Inference in Graphical Models Venkat Chandrasekaran 1, Nathan Srebro 2, and Prahladh Harsha 3 1 Laboratory for Information and Decision Systems Department of Electrical Engineering and Computer
More informationFPT is Characterized by Useful Obstruction Sets
FPT is Characterized by Useful Obstruction Sets Bart M. P. Jansen Joint work with Michael R. Fellows, Charles Darwin Univ. June 21st 2013, WG 2013, Lübeck A NEW CHARACTERIZATION OF FPT 2 Well-Quasi-Orders
More informationThe Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory Tomás Feder Moshe Y. Vardi IBM Almaden Research Center 650 Harry Road San Jose,
More informationQueries and Materialized Views on Probabilistic Databases
Queries and Materialized Views on Probabilistic Databases Nilesh Dalvi Christopher Ré Dan Suciu September 11, 2008 Abstract We review in this paper some recent yet fundamental results on evaluating queries
More informationComplete problems for classes in PH, The Polynomial-Time Hierarchy (PH) oracle is like a subroutine, or function in
Oracle Turing Machines Nondeterministic OTM defined in the same way (transition relation, rather than function) oracle is like a subroutine, or function in your favorite PL but each call counts as single
More informationThe parameterized complexity of counting problems
The parameterized complexity of counting problems Jörg Flum Martin Grohe January 22, 2004 Abstract We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce
More informationTree-width and planar minors
Tree-width and planar minors Alexander Leaf and Paul Seymour 1 Princeton University, Princeton, NJ 08544 May 22, 2012; revised March 18, 2014 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-0901075.
More informationA An Overview of Complexity Theory for the Algorithm Designer
A An Overview of Complexity Theory for the Algorithm Designer A.1 Certificates and the class NP A decision problem is one whose answer is either yes or no. Two examples are: SAT: Given a Boolean formula
More informationLecture 4 : Quest for Structure in Counting Problems
CS6840: Advanced Complexity Theory Jan 10, 2012 Lecture 4 : Quest for Structure in Counting Problems Lecturer: Jayalal Sarma M.N. Scribe: Dinesh K. Theme: Between P and PSPACE. Lecture Plan:Counting problems
More informationLocality of Counting Logics
Locality of Counting Logics Dietrich Kuske Technische Universität Ilmenau 1/22 Example 1 Can a first-order formula distinguish the following two graphs? vs. no, but why? Hanf (1965): every single-centered
More informationAbout the relationship between formal logic and complexity classes
About the relationship between formal logic and complexity classes Working paper Comments welcome; my email: armandobcm@yahoo.com Armando B. Matos October 20, 2013 1 Introduction We analyze a particular
More informationA multivariate interlace polynomial
A multivariate interlace polynomial Bruno Courcelle LaBRI, Université Bordeaux 1 and CNRS General objectives : Logical descriptions of graph polynomials Application to their computations Systematic construction
More informationHomomorphism Preservation Theorem. Albert Atserias Universitat Politècnica de Catalunya Barcelona, Spain
Homomorphism Preservation Theorem Albert Atserias Universitat Politècnica de Catalunya Barcelona, Spain Structure of the talk 1. Classical preservation theorems 2. Preservation theorems in finite model
More informationarxiv: v1 [cs.db] 30 Jun 2014
Query Containment for Highly Expressive Datalog Fragments Pierre Bourhis CNRS LIFL University of Lille 1 & INRIA Lille Nord Europe Lille, FR Markus Krötzsch Fakultät Informatik Technische Universität Dresden,
More informationOn the Expressive Power of Monadic Least Fixed Point Logic
On the Expressive Power of Monadic Least Fixed Point Logic Nicole Schweikardt Institut für Informatik, Humboldt-Universität Berlin, Unter den Linden 6, D-10099 Berlin, Germany, Email: schweika@informatik.hu-berlin.de,
More informationComplexity Classes V. More PCPs. Eric Rachlin
Complexity Classes V More PCPs Eric Rachlin 1 Recall from last time Nondeterminism is equivalent to having access to a certificate. If a valid certificate exists, the machine accepts. We see that problems
More informationCompiling Knowledge into Decomposable Negation Normal Form
Compiling Knowledge into Decomposable Negation Normal Form Adnan Darwiche Cognitive Systems Laboratory Department of Computer Science University of California Los Angeles, CA 90024 darwiche@cs. ucla. edu
More informationNowhere zero flow. Definition: A flow on a graph G = (V, E) is a pair (D, f) such that. 1. D is an orientation of G. 2. f is a function on E.
Nowhere zero flow Definition: A flow on a graph G = (V, E) is a pair (D, f) such that 1. D is an orientation of G. 2. f is a function on E. 3. u N + D (v) f(uv) = w ND f(vw) for every (v) v V. Example:
More informationSplitting the Computational Universe
Splitting the Computational Universe s Theorem Definition Existential Second Order Logic (ESO) is the collection of all statements of the form: ( S )Φ(S, S ) s Theorem Definition Existential Second Order
More informationComputing the Hull Number of Chordal and Distance-Hereditary Graphs. LIMOS - Université Blaise Pascal SOFSEM 2013
Computing the Hull Number of Chordal and Distance-Hereditary Graphs Mamadou M. Kanté Lhouari Nourine LIMOS - Université Blaise Pascal SOFSEM 20 Betweenness Relations A betweenness on a ground set V is
More informationThe complexity of acyclic subhypergraph problems
The complexity of acyclic subhypergraph problems David Duris and Yann Strozecki Équipe de Logique Mathématique (FRE 3233) - Université Paris Diderot-Paris 7 {duris,strozecki}@logique.jussieu.fr Abstract.
More informationLearning Large-Alphabet and Analog Circuits with Value Injection Queries
Learning Large-Alphabet and Analog Circuits with Value Injection Queries Dana Angluin 1 James Aspnes 1, Jiang Chen 2, Lev Reyzin 1,, 1 Computer Science Department, Yale University {angluin,aspnes}@cs.yale.edu,
More informationDefinability of Recursive Predicates in the Induced Subgraph Order
Definability of Recursive Predicates in the Induced Subgraph Order Ramanathan S. Thinniyam Institute of Mathematical Sciences, Chennai ICLA, January 5, 2017 Outline 1. Introduction to graph orders. 2.
More informationConstraint Satisfaction. Complexity. and. Logic. Phokion G. Kolaitis. IBM Almaden Research Center & UC Santa Cruz
Constraint Satisfaction Complexity and Logic Phokion G. Kolaitis IBM Almaden Research Center & UC Santa Cruz 1 Goals Goals: Show that Constraint Satisfaction Problems (CSP) form a broad class of algorithmic
More informationParallel-Correctness and Transferability for Conjunctive Queries
Parallel-Correctness and Transferability for Conjunctive Queries Tom J. Ameloot1 Gaetano Geck2 Bas Ketsman1 Frank Neven1 Thomas Schwentick2 1 Hasselt University 2 Dortmund University Big Data Too large
More informationNP Complete Problems. COMP 215 Lecture 20
NP Complete Problems COMP 215 Lecture 20 Complexity Theory Complexity theory is a research area unto itself. The central project is classifying problems as either tractable or intractable. Tractable Worst
More informationCSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits
CSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits Chris Calabro January 13, 2016 1 RAM model There are many possible, roughly equivalent RAM models. Below we will define one in the fashion
More informationFIRST-ORDER QUERY EVALUATION ON STRUCTURES OF BOUNDED DEGREE
FIRST-ORDER QUERY EVALUATION ON STRUCTURES OF BOUNDED DEGREE INRIA and ENS Cachan e-mail address: kazana@lsv.ens-cachan.fr WOJCIECH KAZANA AND LUC SEGOUFIN INRIA and ENS Cachan e-mail address: see http://pages.saclay.inria.fr/luc.segoufin/
More informationAlgebraic Model Counting
Algebraic Model Counting Angelika Kimmig a,, Guy Van den Broeck b, Luc De Raedt a a Department of Computer Science, KU Leuven, Celestijnenlaan 200a box 2402, 3001 Heverlee, Belgium. b UCLA Computer Science
More informationDeciding first-order properties for sparse graphs
Deciding first-order properties for sparse graphs Zdeněk Dvořák and Daniel Král Deparment of Applied Mathematics and Institute for Theoretical Computer Science (ITI) Faculty of Mathematics and Physics,
More informationSome hard families of parameterised counting problems
Some hard families of parameterised counting problems Mark Jerrum and Kitty Meeks School of Mathematical Sciences, Queen Mary University of London {m.jerrum,k.meeks}@qmul.ac.uk September 2014 Abstract
More informationA Local Normal Form Theorem for Infinitary Logic with Unary Quantifiers
mlq header will be provided by the publisher Local Normal Form Theorem for Infinitary Logic with Unary Quantifiers H. Jerome Keisler 1 and Wafik Boulos Lotfallah 2 1 Department of Mathematics University
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationFriendly Logics, Fall 2015, Lecture Notes 5
Friendly Logics, Fall 2015, Lecture Notes 5 Val Tannen 1 FO definability In these lecture notes we restrict attention to relational vocabularies i.e., vocabularies consisting only of relation symbols (or
More informationFirst-Order Queries over One Unary Function
First-Order Queries over One Unary Function Arnaud Durand 1 and Frédéric Olive 2 1 Equipe de Logique Mathématique, CNRS UMR 7056 - Université Denis Diderot, 2 place Jussieu, 75251 Paris Cedex 05, France
More informationFoundations of Query Languages
Foundations of Query Languages SS 2011 2. 2. Foundations of Query Languages Dr. Fang Wei Lehrstuhl für Datenbanken und Informationssysteme Universität Freiburg SS 2011 Dr. Fang Wei 30. Mai 2011 Seite 1
More informationLocally Consistent Transformations and Query Answering in Data Exchange
Locally Consistent Transformations and Query Answering in Data Exchange Marcelo Arenas University of Toronto marenas@cs.toronto.edu Pablo Barceló University of Toronto pablo@cs.toronto.edu Ronald Fagin
More informationGames and Isomorphism in Finite Model Theory. Part 1
1 Games and Isomorphism in Finite Model Theory Part 1 Anuj Dawar University of Cambridge Games Winter School, Champéry, 6 February 2013 2 Model Comparison Games Games in Finite Model Theory are generally
More informationRewriting Ontological Queries into Small Nonrecursive Datalog Programs
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs Georg Gottlob 1 and Thomas Schwentick 2 1 Department of Computer Science, University of Oxford gottlob@cs.ox.ac.uk 2 Fakultät für
More informationReductions to Graph Isomorphism
Reductions to raph Isomorphism Jacobo Torán Institut für Theoretische Informatik Universität Ulm D-89069 Ulm, ermany jacobo.toran@uni-ulm.de June 13, 2008 Keywords: Computational complexity, reducibilities,
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 18, 2012 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More information1 CHAPTER 1 INTRODUCTION 1.1 Background One branch of the study of descriptive complexity aims at characterizing complexity classes according to the l
viii CONTENTS ABSTRACT IN ENGLISH ABSTRACT IN TAMIL LIST OF TABLES LIST OF FIGURES iii v ix x 1 INTRODUCTION 1 1.1 Background : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.2 Preliminaries
More informationThe Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints ABSTRACT Paraschos Koutris University of Washington, Seattle, USA pkoutris@cs.washington.edu
More informationCombining Existential Rules and Transitivity: Next Steps
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) Combining Existential Rules and Transitivity: Next Steps Jean-François Baget Inria, CNRS, Univ. Montpellier
More information