Extending Decidable Existential Rules by Joining Acyclicity and Guardedness.
Existential rules, i.e. Datalog extended with existential quantifiers in rule heads, are currently studied under a variety of names such as Datalog+/-, ∀∃-rules, and tuple-generating dependencies. The renewed interest in this formalism is fuelled by a wealth of recently discovered language fragments...
Main Authors: | Krötzsch, M, Rudolph, S |
---|---|
Other Authors: | Walsh, T |
Format: | Conference item |
Published: |
IJCAI/AAAI
2011
|
Similar Items
-
Acyclicity notions for existential rules and their application to query answering in ontologies
by: Grau, B, et al.
Published: (2013) -
Computing Stable Models for Nonmonotonic Existential Rules
by: Magka, D, et al.
Published: (2013) -
Dyadic existential rules
by: Gottlob, G, et al.
Published: (2022) -
An extended class of acyclically testable circuits
by: Oka, Nobuyo, et al.
Published: (2007) -
ELP: Tractable Rules for OWL 2.
by: Krötzsch, M, et al.
Published: (2008)