Erratum to splitting an operator: Algebraic modularity results for logics with fixpoint semantics

@article{Vennekens2007ErratumTS,
  title={Erratum to splitting an operator: Algebraic modularity results for logics with fixpoint semantics},
  author={Joost Vennekens and David Gilis and Marc Denecker},
  journal={ACM Trans. Comput. Log.},
  year={2007},
  volume={8},
  pages={7}
}
In [Vennekens et al. 2006], we defined a class of stratified auto-epistemic theories and made the claim that the models of such theories under a number of different semantics (namely, (partial) expansions, (partial) extensions, Kripke-Kleene model and well-founded model) can be constructed in an incremental way, following the stratification of the theory. However, it turns out that this result only holds as long as the constructed models are consistent. This can be demonstrated by the following… 
Groundedness in Logics With a Fixpoint Semantics
TLDR
This dissertation extends approximation fixpoint theory to expose more underlying principles common to the aforementioned logics and shows that the notion of groundedness indeed captures the intuitions that existed in these domains and study complexity of reasoning with grounded models.
Grounded fixpoints and their applications in knowledge representation
In various domains of logic, researchers have made use of a similar intuition: that facts (or models) can be derived from the ground up. They typically phrase this intuition by saying, e.g., that the
On Well-Founded Set-Inductions and Locally Monotone Operators
TLDR
This article shows that for certain classes of theories, this semantics for autoepistemic logic fails to identify the unique intended model, and solves this problem by refining the well-founded semantics.
Fixpoint semantics for active integrity constraints
Abstract Active integrity constraints (AICs) constitute a formalism to associate with a database not just the constraints it should adhere to, but also how to fix the database in case one or more of
Fixpoint Semantics for Recursive SHACL
TLDR
It is shown that from a SHACL schema, a three-valued semantic operator can directly be obtained, which immediately induces a wide variety of semantics, including a supported, stable, and well-founded semantics, related in the expected ways.
Safe inductions and their applications in knowledge representation
TLDR
This paper formally defines the safety criterion algebraically and studies properties of so-called safe inductions and applies the theory to logic programming and autoepistemic logic, showing that safe induction manage to capture the intended meaning of a class of theories on which all classical constructive semantics fail.
New Language Constructs and Inferences for the Knowledge Base Paradigm: A Business and Multi-agent Perspective ; Taaluitbreidingen en nieuwe inferenties voor het kennisbank paradigma vanuit een Business en Multi-Agent perspectief
TLDR
This text uses an implementation of a KB system: the IDP system with corresponding language FO(·) to model challenging and interesting applications and proves the hypothesis that this approach has many advantages over standard declarative paradigms.
A Complete Bibliography of ACM Transactions on Computational Logic
TLDR
Novel odor-flavor materials and methods for producing the same are disclosed comprising a mixture of various gamma-lactones, exhibiting extremely pleasing taste and/or flavor characteristics.
LP2PB: Translating Answer Set Programs into Pseudo-Boolean Theories
TLDR
Results are mixed: overall, traditional ASP solvers still outperform the translational approach, but several benchmark families are identified where the balance shifts the other way, thereby suggesting that further investigation into a stronger proof system for ASP is valuable.

References

SHOWING 1-10 OF 66 REFERENCES
A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties
  • J. Dix
  • Computer Science
    Fundam. Informaticae
  • 1995
TLDR
This article presents a method for classifying and characterizing the various different semantics of logic programs with negation and shows that the 3-valued version COMP 3 of Clark's completion, the stratified semantics M supp P as well as the well-founded semantics WFS and two extensions of it behave very regular.
Splitting an operator: Algebraic modularity results for logics with fixpoint semantics
TLDR
This work presents a general, algebraic splitting theory for logics with a fixpoint semantics, and demonstrates the usefulness of these results, by generalizing existing results for logic programming, auto-epistemic logic and default logic.
A Classification Theory of Semantics of Normal Logic Programs: II. Weak Properties
  • J. Dix
  • Computer Science
    Fundam. Informaticae
  • 1995
TLDR
The main results state that any well-behaved-semantics is an extension of the well-founded semantics WFS and coincides for stratified programs with Apt, Blair, and Walker’s supported model M supp P .
Splitting an operator: an algebraic modularity result and its application to auto-epistemic logic
TLDR
This work presents a general, algebraic theory of splitting under a £xpoint semantics, and demonstrates the usefulness of this approach, by applying the results to auto-epistemic logic.
Splitting an Operator
TLDR
This work presents a general, algebraic splitting theory for programs/theories under a fixpoint semantics, and demonstrates the usefulness of these results, by generalizing Lifschitz and Turner’s splitting theorem to other semantics for (non-disjunctive) logic programs.
A Kripke-Kleene Semantics for Logic Programs
  • M. Fitting
  • Computer Science, Mathematics
    J. Log. Program.
  • 1985
The use of conventional classical logic is misleading for characterizing the behavior of logic programs because a logic program, when queried, will do one of three things: succeed with the query,
The well-founded semantics for general logic programs
TLDR
It is shown that the class of programs possessing a total well-founded model properly includes previously studied classes of "stratified" and "locally stratified" programs, and is compared with other proposals in the literature.
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
TLDR
This paper formalizes the concept of one-step-provability for disjunctive logic programs by means of non-deterministic operators on the lattice of interpretations and develops results for programs in propositional language extended with monotone aggregate atoms.
Uniform semantic treatment of default and autoepistemic logics
TLDR
This work develops a general semantic approach to autoepistemic and default logics that is based on the notion of a belief pair and that exploits the lattice structure of the collection of all belief pairs, and establishes conclusively that default logic can be viewed as a fragment of autoEPistemic logic.
Compositionality of Normal Open Logic Programs
TLDR
This work studies compositionality in the context of normal open logic programming, a logic for knowledge representation in thecontext of uncertainty and incomplete knowledge on concepts and on problem domain, in which the compositionality issue turns up very naturally.
...
1
2
3
4
5
...