# On Cascade Products of Answer Set Programs

@article{Antic2014OnCP, title={On Cascade Products of Answer Set Programs}, author={Christian Antic}, journal={Theory and Practice of Logic Programming}, year={2014}, volume={14}, pages={711 - 723} }

Abstract Describing complex objects by elementary ones is a common strategy in mathematics and science in general. In their seminal 1965 paper, Kenneth Krohn and John Rhodes showed that every finite deterministic automaton can be represented (or “emulated”) by a cascade product of very simple automata. This led to an elegant algebraic theory of automata based on finite semigroups (Krohn-Rhodes Theory). Surprisingly, by relating logic programs and automata, we can show in this paper that the…

## 2 Citations

### Algebraic answer set programming

- Computer Science, MathematicsArXiv
- 2021

The semantic side, it is shown that the immediate consequence operator of a program can be represented via composition, which allows us to compute the least model semantics of Horn programs without any explicit reference to operators.

### Sequential composition of propositional logic programs

- Computer Science
- 2020

It is shown that acyclic programs can be decomposed into single-rule programs and provide a general decomposition result for arbitrary programs and the immediate consequence operator of a program can be represented via composition which allows us to compute its least model without any explicit reference to operators.

## References

SHOWING 1-10 OF 15 REFERENCES

### Approximations, Stable Operators, Well-founded Fixpoints and Applications in Nonmonotonic Reasoning

- Computer Science, Mathematics
- 2000

An algebraic construction which assigns a certain operator, called the stable operator, to every approximating operator on a bilattice of approximations leads to an abstract version of the well-founded semantics of nonmonotonic logics.

### Modular Nonmonotonic Logic Programming Revisited

- Computer ScienceICLP
- 2009

This paper focuses on modular nonmonotonic logic programs (MLP) under the answer set semantics, whose modules may have contextually dependent input provided by other modules, and defines a model-theoretic semantics for this extended setting.

### Classical negation in logic programs and disjunctive databases

- Computer ScienceNew Generation Computing
- 2009

It is shown that some facts of commonsense knowledge can be represented by logic programs and disjunctive databases more easily when classical negation is available.

### Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory

- Computer ScienceCIAA
- 2004

The hierarchical algebraic decomposition of finite state automata (Krohn-Rhodes Theory) has been a mathematical theory without any computational implementations until the present paper, although…

### Hex Semantics via Approximation Fixpoint Theory

- Computer ScienceLPNMR
- 2013

This paper uniformly defines 2-, and 3-valued ultimate answer-set semantics, and well-founded semantics of disjunction-free Hex programs by applying AFT, and extensively compare the semantics to closely related semantics, including constructive dl-program semantics.

### Products of Automata

- Mathematics, Computer ScienceEATCS Monographs in Theoretical Computer Science
- 1986

1. Basic Concepts and Preliminaries.- 1.1 Sets and Relations.- 1.2 Algebraic Structures.- 1.3 Automata and Sequential Machines.- 1.4 Products and Complete Systems of Sequential Machines and…

### Uniform semantic treatment of default and autoepistemic logics

- Philosophy, Computer ScienceArtif. Intell.
- 2000

### Nonmonotonic Multi-Context Systems: A Flexible Approach for Integrating Heterogeneous Knowledge Sources

- Computer ScienceLogic Programming, Knowledge Representation, and Nonmonotonic Reasoning
- 2011

This paper gives an overview on multi-context systems (MCS) with a special focus on their recent nonmonotonic extensions, and introduces generalizations of the existing framework which the author considers useful.

### Algebraic theory of automata networks - an introduction

- Computer ScienceSIAM monographs on discrete mathematics and applications
- 2005

This paper presents a meta-analyses of Krohn-Rhodes theory and its applications to automata networks, aiming at determining the boundaries between state-homogeneous and asynchronous networks.

### Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines

- Mathematics
- 1965

Introduction. In the following all semigroups are of finite order. One semigroup S, is said to divide another semigroup S2, written SlIS2, if S, is a homomorphic image of a subsemigroup of S2. The…