---
title: Disjunctive Existential Rules Overview
url: https://www.emergentmind.com/topics/disjunctive-existential-rules
type: topic
---

# Disjunctive Existential Rules Overview

Searching arXiv for recent and foundational papers on disjunctive existential rules and related existential-rule languages.
Disjunctive existential rules are first-order rules whose heads may contain both existential quantification and disjunction. In the database and knowledge-representation literature they are commonly presented as disjunctive tuple-generating dependencies (DTGDs) or, in the more general setting with equalities, disjunctive embedded dependencies (DEDs). They are used to represent domain knowledge for ontology-mediated query answering (OMQA), query rewriting, and rule-based reasoning with incomplete or choice-like information. A standard form is
\[
\forall \mathbf{x}\,\forall \mathbf{y}\;\Bigl(
B(\mathbf{x},\mathbf{y}) \;\longrightarrow\;
\bigvee_{i=1}^n \exists \mathbf{z_i}\;H_i(\mathbf{x}_i,\mathbf{z_i})
\Bigr),
\]
where the body is a conjunction of atoms and each head disjunct is itself a conjunction of atoms; conjunctive rules arise as the special case \(n=1\) [2306.05973]. In OMQA, these rules induce ontologies via entailment of Boolean unions of conjunctive queries, and a central line of research studies their semantic behavior, expressive power, rewritability, decidable fragments, and complexity frontiers [2112.08136].

## 1. Formalism and semantic interpretation

A disjunctive existential rule is a first-order sentence whose body is a conjunction of atoms and whose head is a disjunction of conjunctions, possibly with existential variables in each disjunct [2306.05973]. In the terminology of generalized dependencies, a disjunctive embedded dependency is a safe generalized dependency with \(n \ge 1\), and a disjunctive tuple-generating dependency is a DED without equality in body or head [2001.08688]. When \(k=1\), a DTGD is an ordinary TGD; when \(k>1\), it is genuinely disjunctive [2112.08136].

The Tarskian semantics is standard. A structure satisfies such a rule if every assignment satisfying the body can be extended so that at least one head disjunct is satisfied [2310.12884]. Equivalently, whenever there is a homomorphism from the canonical body-instance into a structure, that homomorphism extends, for some head disjunct, to a homomorphism from that disjunct into the structure [2001.08688].

In OMQA, one fixes disjoint data and query schemas and considers Boolean UCQs over the query schema. An ontology is represented as a set of pairs \((D,q)\), where \(D\) is a finite database and \(q\) is a Boolean UCQ, subject to closure under query conjunction, query implication, injective homomorphism, and constant renaming [2112.08136]. Given a finite set \(\Sigma\) of DEDs, the induced ontology is
\[
[\![\Sigma]\!]_{\mathscr{D},\mathscr{Q}}
=\{(D,q)\mid D\cup\Sigma\models q\},
\]
and an ontology is said to be defined by \(\Sigma\) when equality holds [2112.08136].

A basic intuition behind the formalism is that disjunction models alternatives or uncertain choices while existential quantification introduces unnamed witnesses. One canonical example is the rule
\[
P(x)\;\longrightarrow\;Q(x)\;\vee\;R(x),
\]
which entails \(Q(a)\vee R(a)\) from \(P(a)\), but entails neither \(Q(a)\) nor \(R(a)\) alone [2112.08136]. Another standard illustration is
\[
\forall X\;\bigl(\mathit{person}(X)\;\rightarrow\;
(\exists Y\;\mathit{parent}(X,Y)\wedge\mathit{male}(Y))
\;\lor\;
(\exists Z\;\mathit{parent}(X,Z)\wedge\mathit{female}(Z))\bigr),
\]
used to encode a choice between two existentially witnessed alternatives [1405.5109].

## 2. Chase-based semantics and universal models

Reasoning with disjunctive existential rules is commonly based on a branching chase. For DTGDs, a nondeterministic chase step applies a trigger \((r,h)\) when the body of \(r\) maps into the current fact base, then chooses one of the head disjuncts and adds the corresponding facts with fresh existential witnesses [2306.05973]. In a more explicit tree presentation, a disjunctive chase step transforms one instance into \(n\) children, one per disjunct [1405.5109].

A derivation tree is fair if every trigger that becomes enabled on a branch is eventually satisfied by choosing one of its disjuncts [2306.05973]. The chase result is the set of fact bases appearing along all branches of a fair derivation tree, possibly infinite [2306.05973]. In the universal-model view, the leaves of a fair disjunctive chase tree are universal models in the sense that each leaf satisfies the initial database and rule set, and every model of the knowledge base receives a homomorphism from some leaf [1405.5109].

Soundness and completeness take the expected form. For DTGDs and Boolean UCQs,
\[
D\cup\Sigma\models q
\quad\Longleftrightarrow\quad
\mathrm{chase}(D,\Sigma)\models q
\]
under the nondeterministic chase presentation of [2112.08136]. In the derivation-tree presentation, for every UCQ \(\mathcal Q\) and knowledge base \((F,\mathcal R)\),
\[
F,\mathcal R\models\mathcal Q
\quad\Longleftrightarrow\quad
\bigl(\text{every fact base in }chase(F,\mathcal R)\bigr)\models\mathcal Q
\]
[2306.05973]. This equivalence is the semantic basis for both forward-chaining procedures and backward query rewriting.

The same semantic perspective also appears in Datalog with existential quantification and disjunction. There, an instantiation procedure produces a universal model set, and query answering reduces to entailment over that instantiated ground program [1210.2316]. This suggests a close methodological connection between disjunctive existential rules, disjunctive Datalog with existentials, and ontology-oriented chase semantics.

## 3. Expressive power in ontology-mediated query answering

A major result for OMQA concerns the program expressive power of disjunctive TGDs. An OMQA\([\mathsf{UCQ}]\)-ontology is DTGD-definable iff it is closed under all database homomorphisms and under all constant substitutions [2112.08136]. More precisely, if \((D,q)\in O\) and \(h:D\to_{\mathrm{const}(q)}D'\) is a homomorphism fixing the query constants, then \((D',q)\in O\); and if \(\tau\) uniformly renames constants, then \((\tau(D),\tau(q))\in O\) [2112.08136]. The characterization is purely model-theoretic and does not require tree automata, unlike the non-disjunctive linear-TGD case [2112.08136].

This criterion identifies exactly the OMQA ontologies axiomatizable by finite DTGD sets [2112.08136]. The proof strategy has two directions. The “only if” part uses the nondeterministic chase and the homomorphism behavior of UCQs. The “if” part starts from a finite DED-ontology with the two closure properties and eliminates equalities through an auxiliary relation \(Eq\), forcing it to behave as an equivalence relation and propagating it onto every predicate; the result is a DTGD-only axiomatization [2112.08136].

At a broader level, finite sets of DEDs are expressively complete for recursively enumerable OCQA ontologies [1604.05006]. This completeness result is formulated in a semantic framework where ontologies are sets of database-query pairs satisfying conjunction, implication, and injective-homomorphism closure. The proof uses a universal-model construction \(U_O(D)\) and a simulation of a convergent, 2-bounded nondeterministic Turing machine by a finite DED set [1604.05006]. By contrast, neither finite DTGD sets nor finite ED sets are expressively complete for recursively enumerable OCQA ontologies [1604.05006].

The contrast between DEDs and DTGDs is sharp. Any ontology defined by finite DTGDs is closed under arbitrary database homomorphisms, and this excludes ontologies that fail homomorphism closure [1604.05006]. Likewise, every ED-defined OCQA ontology is closed under direct products of databases, so EDs alone cannot capture all recursively enumerable OCQA ontologies [1604.05006]. This establishes disjunctive existential rules with equalities as a strictly more expressive rule language in the OCQA sense.

## 4. Model-theoretic characterizations beyond OMQA

The model theory of disjunctive existential rules has also been studied outside the OMQA setting. For arbitrary structures, a first-order sentence is equivalent to a finite set of DEDs iff it is preserved under globally-homomorphic preimages and admits both a trivial model and a sharp model [2001.08688]. Here, preservation under globally-homomorphic preimages refines ordinary homomorphism preservation, while the trivial and sharp model conditions eliminate negative constraints and enforce the safety conditions needed for DEDs [2001.08688].

This characterization yields a polynomial-time test for deciding whether a finite set of generalized dependencies is equivalent to some finite DED set: it suffices to check the two small test structures corresponding to the trivial and sharp models [2001.08688]. For general FO-sentences, however, rewritability into finite DED sets is RE-complete, and coRE-complete over finite models [2001.08688].

A more recent line of work studies finite axiomatizability of classes of relational structures by disjunctive existential rules. For a class \(\mathcal C\), finite axiomatizability by \((n,m,\ell)\)-dexrs is characterized by three properties: criticality, closure under repairable direct products, and diagrammatic \((n,m,\ell)\)-compatibility [2508.11946]. Criticality requires arbitrarily large complete finite structures; repairable direct products generalize product closure to accommodate disjunction; diagrammatic compatibility is a locality-style condition based on diagrams and bounded forbidden patterns [2508.11946].

The same framework extends to linear and guarded disjunctive existential rules through linear-diagrammatic and guarded-diagrammatic compatibility [2508.11946]. The paper also gives a guarded-to-linear rewriting criterion via a bounded linearization lemma and an elementary-time decision procedure, stated to be 3-EXPTIME [2508.11946]. This suggests that the model-theoretic analysis of disjunctive existential rules supports not only expressiveness classification but also normalization and fragment-reduction questions.

## 5. Query rewriting and the finite-unification frontier

While chase-based query answering with disjunctive existential rules had been well studied, query rewriting within UCQs was addressed directly by a sound and complete rewriting operator that mirrors chase steps by rewriting steps [2306.05973]. The construction starts from piece-unifiers in the conjunctive case and generalizes them to disjunctive piece-unifiers, one per head disjunct, with jointly admissible partitions [2306.05973]. The resulting one-step rewriting operator \(\beta_\vee\) supports a correspondence between fact-level chase steps and query-level rewriting steps [2306.05973].

A breadth-first rewriting algorithm computes level by level, uses a minimal-cover operator to remove subsumed queries, and returns a minimal UCQ-rewriting when one exists [2306.05973]. The theorem states that for every UCQ \(\mathcal Q\), fact base \(F\), and disjunctive rule set \(\mathcal R\),
\[
F,\mathcal R\models\mathcal Q
\]
iff there is a finite rewriting \(\mathcal Q'\) produced by iterated \(\beta_\vee\)-steps such that \(F\models\mathcal Q'\) [2306.05973].

A central negative result is that “truly disjunctive” nonrecursive rules need not admit finite UCQ rewritings. Already for
\[
r:\;p(x,y)\;\longrightarrow\;t_1(x)\;\lor\;t_2(y)
\]
and
\[
Q_0 := \{\,t_1(u),\,t_2(u)\},
\]
any UCQ-rewriting must contain one CQ for each natural number \(n\), namely the paths of length \(n\) from a \(t_2\) to a \(t_1\); these CQs are pairwise incomparable by homomorphism, so no finite UCQ-rewriting exists [2306.05973]. More generally, for any connected disjunctive rule \(r:B\to H_1\lor H_2\) not equivalent to a single-disjunct rule, there exists a Boolean CQ \(Q\) such that \((\{Q\},\{r\})\) is not UCQ-rewritable [2306.05973].

This undermines the usefulness of finite unification sets in the unrestricted disjunctive setting. The notion of fus, which in the conjunctive setting denotes rule classes under which every UCQ admits a finite UCQ-rewriting, “seems to have little relevance in this setting” [2306.05973]. Nevertheless, decidable islands remain, including atomic or full CQs under single-atom disjunctive rules and source-to-target mappings, where each piece-unifier strictly reduces target-predicate atoms [2306.05973].

Subsequent work introduces syntactic classes designed to recover the fus property. Connected domain-restricted rules and connected linear rules are fus in the non-disjunctive case [2310.12884]. For the disjunctive case, the extension uses disconnected disjunction: distinct disjuncts may not reference variables from the same body-connected component [2310.12884]. If \(R^\exists\) is any fus set of non-disjunctive rules and \(R^\vee\) is a finite set of D-disjunctive rules, then \(R^\exists\cup R^\vee\) is fus even in the presence of disjunction [2310.12884].

## 6. Decidability, complexity, and restricted fragments

The computational effect of adding disjunction depends strongly on the syntactic fragment. For guarded disjunctive TGDs, Boolean CQ answering is 2EXPTIME-hard in combined complexity, already with a fixed set of binary DIDs, and lies in coNP in data complexity [1405.5109]. Membership in 2EXPTIME is obtained by a tree-automata construction over the disjunctive chase, while coNP data membership follows by nondeterministically guessing a finite chase branch and checking the query in polynomial time [1405.5109].

For sticky disjunctive TGDs, Boolean CQ answering becomes undecidable even in data complexity, already for a single sticky DTGD with two disjuncts [1405.5109]. The proof encodes a Turing machine with an infinite tape, using disjunction to guess successor tape symbols and nontermination of the chase to encode infinitary computation [1405.5109].

For weakly-acyclic DTGDs, the disjunctive chase always terminates in finitely many steps on any database [1405.5109]. In this fragment, Boolean CQ answering is P-complete in data complexity and 2EXPTIME-hard in combined complexity; an upper bound in 2EXPTIME is obtained by constructing the entire chase tree and checking the leaves [1405.5109].

A closely related complexity picture appears in Datalog\({}^{\exists\vee}\). Query answering is undecidable in general; guarded Datalog\({}^{\exists\vee}\) is decidable and in 2ExpTime with a matching 2ExpTime lower bound; weakly-guarded Datalog\({}^{\exists\vee}\) is also in 2ExpTime and 2ExpTime-hard; and data complexity ranges from \(AC^0\) to ExpTime depending on the fragment and query shape [1210.2316]. These results indicate that disjunctive existential rules inherit the expressivity-versus-tractability pattern characteristic of existential-rule languages, but with significantly sharper worst-case behavior once disjunction is admitted.

Under closed predicates and repair-based semantics, DEDs with inequalities yield a further complexity landscape for consistent query answering. Repair checking is coNP-complete for arbitrary DEDs, PTIME-complete for linear DEDs, PTIME for full DEDs, and in \(AC^0\) for acyclic DEDs [2401.05743]. For IAR- and AR-query answering, the general problem is \(\Pi_2^P\)-complete, while full or acyclic DEDs give coNP-completeness, linear DEDs give PTIME, and several combined fragments, including acyclic+linear and full+linear, are in \(AC^0\) [2401.05743]. This suggests that disjunctive existential rules also play a role in inconsistency-tolerant semantics, not only in open-world OMQA.

## 7. Systems, applications, and recurring misconceptions

A concrete implementation of backward-chaining rewriting for disjunctive existential rules is ECOMPLETO, implemented in Elixir and targeting Boolean conjunctive queries with universally quantified negation [2310.12884]. Its parser accepts DLGP\(^+\) ontologies with disjunctive heads written as square-bracket lists and minus-prefixed atoms for negation; its rewriting engine alternates non-disjunctive and disjunctive rewriting phases; and, for fus fragments such as CDR/CLR plus disconnected disjunction, the outer fixpoint loop halts [2310.12884].

The reported evaluation used two enriched ontologies—LUBM with 70 extra disjoint class axioms and Travel with 10 disjoint class axioms—and 500 random Boolean CQs per ontology, each with 3 atoms, 2 negated, and 1 answer variable in the frontier [2310.12884]. ECOMPLETO “succeeded in producing finite UCQ-rewritings for all 1 000 queries,” with the following reported means and standard deviations [2310.12884]:

| Metric | LUBM | Travel |
|---|---:|---:|
| mean time | 18.59 m | 0.035 m |
| std time | 1.67 m | 0.150 m |
| mean memory | 370 MB | 104 MB |
| std memory | 37 MB | 16.7 MB |

The paper further states that Travel queries rewrote on average 500× faster and used \(\sim\!\frac13\) of the RAM compared to LUBM [2310.12884].

Several misconceptions recur in the literature. One is that disjunctive existential rules can be understood purely as ordinary TGDs plus a syntactic head disjunction. The formal and complexity results show otherwise: disjunction changes rewritability, breaks many classical fus arguments, and can raise complexity to 2EXPTIME-hardness or undecidability depending on the fragment [2306.05973]. A second misconception is that tree-automata machinery is intrinsic to all disjunctive-TGD expressive-power results. For the OMQA program expressive power of DTGDs, the key characterization is purely model-theoretic; tree automata are needed only in the non-disjunctive linear-TGD case [2112.08136]. A third misconception is that direct-product closure is the right closure notion for disjunctive existential rules in general. The finite-axiomatizability results show that direct products may fail under disjunction, motivating repairable direct products instead [2508.11946].

Disjunctive existential rules therefore occupy a distinctive position in database theory and knowledge representation. They generalize classical existential rules by admitting alternative existential consequences, they support a precise chase semantics via branching universal models, and they admit exact model-theoretic characterizations in both OMQA and axiomatizability settings [2112.08136]. At the same time, their algorithmic behavior is markedly more delicate than that of their non-disjunctive counterparts, which has driven the design of restricted fragments such as guarded, weakly-acyclic, connected linear, connected domain-restricted, and disconnected-disjunction classes [1405.5109]. A plausible implication is that the long-term development of the area will continue to balance three interacting goals already visible in the current literature: semantic expressiveness, finite rewritability, and controlled combinatorics of branching reasoning.

Source: https://www.emergentmind.com/topics/disjunctive-existential-rules