Foundations of Declarative Data Analysis Using Limit Datalog Programs

@inproceedings{Kaminski2017FoundationsOD,
  title={Foundations of Declarative Data Analysis Using Limit Datalog Programs},
  author={Mark Kaminski and Bernardo Cuenca Grau and Egor V. Kostylev and Boris Motik and Ian Horrocks},
  booktitle={IJCAI},
  year={2017}
}
Motivated by applications in declarative data analysis, we study $\mathit{Datalog}_{\mathbb{Z}}$---an extension of positive Datalog with arithmetic functions over integers. This language is known to be undecidable, so we propose two fragments. In $\mathit{limit}~\mathit{Datalog}_{\mathbb{Z}}$ predicates are axiomatised to keep minimal/maximal numeric values, allowing us to show that fact entailment is coNExpTime-complete in combined, and coNP-complete in data complexity. Moreover, an additional… 
Limit Datalog: A Declarative Query Language for Data Analysis
TLDR
Lim limit DatalogZ provides a unified logical framework for declarative data analysis and can be used as a basis for understanding the expressive power of the key data analysis constructs.
Limit Datalog
TLDR
The proposed limit DatalogZ provides a unified logical framework for declarative data analysis and can be used as a basis for understanding the expressive power of the key data analysis constructs.
Complexity and Expressive Power of Disjunction and Negation in Limit Datalog
TLDR
This paper studies the complex and expressive power of limit Datalog programs extended with disjunction in the heads of rules and non-monotonic negation under the stable model semantics and shows that the resulting language is Π EXP 2 -complete in combined complexity and that it captures Π P 2 over ordered struc-tures in the sense of descriptive complexity.
Stratified Negation in Limit Datalog Programs
TLDR
This paper studies an extension of limit programs with stratified negation-as-failure, and shows that the additional expressive power makes reasoning computationally more demanding, and provides tight data complexity bounds.
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses
TLDR
Initial limit Datalog is presented, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable, and the set of all entwined structures is recursively enumerable, and model checking isdecidable.
Rewrite or Not Rewrite? ML-Based Algorithm Selection for Datalog Query Answering on Knowledge Graphs
TLDR
This work describes a first-of-its-kind method that builds a Machine Learning (ML) model to predict whether a query should be answered with MS or with QSQ, and shows that this leads to a significant reduction of the response time of query answering.
Too Much Information: Can AI Cope with Modern Knowledge Graphs?
TLDR
It is argued that a more principled integrated approach to this task is possible using declarative methods from knowledge representation and reasoning, and that modern rule-based systems are a promising platform for computing customised views on knowledge graphs.
Reasoning Web. Declarative Artificial Intelligence: 16th International Summer School 2020, Oslo, Norway, June 24–26, 2020, Tutorial Lectures
TLDR
This tutorial explores the main design choices available, and the situations in which they may be meaningful or not, and dives deeper into a specific family of probabilistic ontology languages which can express logical and Probabilistic dependencies between axioms.
Knowledge Extraction and Knowledge Graph Construction Based on Campus Security Logss
TLDR
A knowledge extraction model based on entity relation triples is proposed in this paper, which deals with structured or semi-structured campus security logs and demonstrates that the proposed model not only can extract implicit knowledge, but also efficiently visualize knowledge as graph.
Automated Reasoning and Ontology
TLDR
RDF/OWL graphs can be seen as exchangeable knowledge graphs in the big data era.
...
1
2
...

References

SHOWING 1-10 OF 47 REFERENCES
Extending the power of datalog recursion
TLDR
Datalog enables the efficient formulation of queries that could not be expressed efficiently or could not been expressed at all in Datalog with stratified negation and aggregates, and shows that diffusion models and page rank computations can be easily expressed and efficiently implemented using Datalogs.
Low Complexity Aggregation in GraphLog and Datalog
Low Complexity Aggregation in GraphLog and Datalog
TLDR
The Datalog language can be extended to compute a large class of queries with aggregates without incurring the large expense of a language with general set manipulation capabilities, and aims for queries that can be executed eeciently in parallel, using the class nc and its various subclasses as formal models of low parallel complexity.
Artifact systems with data dependencies and arithmetic
TLDR
This article identifies a practically significant class of business artifacts with data dependencies and arithmetic, for which verification is decidable, and identifies various realistic restrictions yielding more palatable upper bounds.
Asynchronous and Fault-Tolerant Recursive Datalog Evaluation in Shared-Nothing Engines
TLDR
It is found that no single method outperforms others but rather that application properties must drive the selection of the iterative query execution model.
The well-founded semantics of aggregation
TLDR
Extensions to the semantics, restrictions on the input, and other supplementary requirements proposed in earlier studies appear to be unnecessary for the purpose of attaching a meaning to a program that involves recursion through aggregation.
Semantics of Logic Programs with Aggregates
TLDR
The two most successful semantic approaches to the problem of recursion through negation, well founded models and stable models, are extended to programs with aggregates and there are programs not captured in any previously deened class where the unique stable model agrees with their \intuitive" semantics.
Dyna: Extending Datalog for Modern AI
TLDR
This work shows that a broad spectrum of AI algorithms can be concisely captured by writing down systems of equations in notation, and motivates certain extensions to Datalog, which are connected to functional and object-oriented programming paradigms.
...
1
2
3
4
5
...