Affiliation:
1. Vrije Universiteit Brussel (VUB), Belgium
2. University of Southern Denmark, Odense, Denmark
Abstract
Approximation fixpoint theory (AFT) is an algebraic study of fixpoints of lattice operators that unifies various knowledge representation formalisms. In AFT, stratification of operators has been studied, essentially resulting in a theory that specifies when certain types of fixpoints can be computed stratum per stratum. Recently, novel types of fixpoints related to
groundedness
have been introduced in AFT. In this article, we study how those fixpoints behave under stratified operators.
One recent application domain of AFT is the field of
active integrity constraints
(AICs). We apply our extended stratification theory to AICs and find that existing notions of stratification in AICs are covered by this general algebraic definition of stratification. As a result, we obtain stratification results for a large variety of semantics for AICs.
Funder
Danish Council for Independent Research, Natural Sciences
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Embedding justification theory in approximation fixpoint theory;Artificial Intelligence;2024-06
2. Approximation Fixpoint Theory in Coq;Lecture Notes in Computer Science;2024
3. Fixpoint Semantics for Recursive SHACL;Electronic Proceedings in Theoretical Computer Science;2021-09-17