Splitting an operator: Algebraic modularity results for logics with fixpoint semantics

Simple item page
dc.creatorVennekens, Joost
dc.creatorGilis, David
dc.creatorDenecker, Marc
dc.date2004-05-03
dc.date2006-10-26
dc.date.accessioned2026-07-07T06:36:36Z
dc.date.available2026-07-07T06:36:36Z
dc.descriptionIt 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.
dc.descriptionRevised to correct a substantial error in Section 4.2.2 (certain results which only hold for_consistent_ possible world sets were stated to hold in general)
dc.identifierhttps://arxiv.org/abs/cs/0405002
dc.identifierhttp://arxiv.org/abs/cs/0405002
dc.identifierACM Transactions on Computational Logic, Volume 7, Number 4, 2006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/100133
dc.subjectArtificial Intelligence
dc.subjectLogic in Computer Science
dc.subjectI.2.3; I.2.4
dc.titleSplitting an operator: Algebraic modularity results for logics with fixpoint semantics
dc.typetext

Files

Collections

arXiv