Corpus ID: 21261409

On the Relationship of Joint Acyclicity and Super-Weak Acyclicity

  title={On the Relationship of Joint Acyclicity and Super-Weak Acyclicity},
  author={M. Kr{\"o}tzsch and S. Rudolph},
  • M. Krötzsch, S. Rudolph
  • Published 2013
  • Computer Science
  • Rules that allow existential quantifiers in the head (conclusion) have been studied extensively in knowledge representation, databases, and logic programming (in the related form of logic programs with function symbols). In general, it is not decidable if a set of such rules admits a finite model, but a number of sufficient conditions have been proposed to detect situations where this is the case. Two such acyclicity conditions are joint acycliclity [8] and super-weak acyclicity [9]. This short… CONTINUE READING
    3 Citations
    Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
    • 100
    • PDF
    Towards Better SWRL Rules Dependency Extraction
    • 1


    On rules with existential variables: Walking the decidability line
    • 286
    • PDF
    Extending Decidable Existential Rules by Joining Acyclicity and Guardedness
    • 128
    • PDF
    Embedded implicational dependencies and their inference problem
    • 127
    Datalog programs and their persistency numbers
    • 7
    Generalized schema-mappings: from termination to tractability
    • 182
    The Implication Problem for Data Dependencies
    • 248
    • PDF
    Reformulation of XML Queries and Constraints
    • 207
    • PDF
    Data Exchange: Semantics and Query Answering
    • 1,043
    • PDF
    Complexity and expressive power of logic programming
    • 264