Computer Science – Artificial Intelligence
Scientific paper
2004-05-03
ACM Transactions on Computational Logic, Volume 7, Number 4, 2006
Computer Science
Artificial Intelligence
Revised to correct a substantial error in Section 4.2.2 (certain results which only hold for_consistent_ possible world sets w
Scientific paper
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "levels", such that the models of the entire program can be constructed by incrementally constructing models for each level. Similar results exist for other non-monotonic formalisms, such as auto-epistemic logic and default logic. In this work, we present a general, algebraicsplitting theory for logics with a fixpoint semantics. Together with the framework of approximation theory, a general fixpoint theory for arbitrary operators, this gives us a uniform and powerful way of deriving splitting results for each logic with a fixpoint semantics. We demonstrate the usefulness of these results, by generalizing existing results for logic programming, auto-epistemic logic and default logic.
Denecker Marc
Gilis David
Vennekens Joost
No associations
LandOfFree
Splitting an operator: Algebraic modularity results for logics with fixpoint semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Splitting an operator: Algebraic modularity results for logics with fixpoint semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Splitting an operator: Algebraic modularity results for logics with fixpoint semantics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-234827