article

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

Authors:

Joost Vennekens,

David Gilis,

Marc DeneckerAuthors Info & Claims

ACM Transactions on Computational Logic (TOCL), Volume 8, Issue 1

Pages 7 - es

https://doi.org/10.1145/1182613.1189735

Published: 01 January 2007 Publication History

Get Access

References

[1]

Gelfond, M. and Przymusinska, H. 1992. On consistency and completeness of autoepistemic theories. Fundamenta Informaticae 16, 1, 59--92.

Digital Library

Google Scholar

[2]

Niemelä, I. and Rintanen, J. 1994. On the impact of stratification on the complexity of nonmonotonic reasoning. J. Appl. Nonclassic. Logics 4, 2.

Google Scholar

[3]

Turner, H. 1996. Splitting a default theory. In Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference. AAAI Press, 645--651.

Digital Library

Google Scholar

[4]

Vennekens, J., Gilis, D., and Denecker, M. 2006. Splitting an operator: Algebraic modularity results for logics with fixpoint semantics. ACM Trans. Computat. Logic 7, 4, 765--797.

Digital Library

Google Scholar

Cited By

View all

Marynissen SBogaerts BDenecker M(2024)Embedding justification theory in approximation fixpoint theoryArtificial Intelligence10.1016/j.artint.2024.104112331:COnline publication date: 1-Jun-2024
https://dl.acm.org/doi/10.1016/j.artint.2024.104112
Bogaerts BCruz-Filipe L(2024)Approximation Fixpoint Theory in CoqLogics and Type Systems in Theory and Practice10.1007/978-3-031-61716-4_5(84-99)Online publication date: 22-May-2024
https://doi.org/10.1007/978-3-031-61716-4_5
Bogaerts BJakubowski M(2021)Fixpoint Semantics for Recursive SHACLElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.345.14345(41-47)Online publication date: 17-Sep-2021
https://doi.org/10.4204/EPTCS.345.14
Show More Cited By

Index Terms

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

Recommendations

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

It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, that is, to divide such a program into a number of different “levels”, such that the models of the entire program can be constructed by ...
Erratum to: "a new framework for declarative programming"

We propose a new framework for the syntax and semantics of Weak Hereditarily Harrop logic programming with constraints, based on resolution over τ-categories: finite product categories with canonical structure.Constraint information is directly built-in ...
Adding the Everywhere Operator to Propositional Logic

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Computational Logic

ACM Transactions on Computational Logic Volume 8, Issue 1

January 2007

210 pages

ISSN:1529-3785

EISSN:1557-945X

DOI:10.1145/1182613

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 2007

Published in TOCL Volume 8, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
186
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Marynissen SBogaerts BDenecker M(2024)Embedding justification theory in approximation fixpoint theoryArtificial Intelligence10.1016/j.artint.2024.104112331:COnline publication date: 1-Jun-2024
https://dl.acm.org/doi/10.1016/j.artint.2024.104112
Bogaerts BCruz-Filipe L(2024)Approximation Fixpoint Theory in CoqLogics and Type Systems in Theory and Practice10.1007/978-3-031-61716-4_5(84-99)Online publication date: 22-May-2024
https://doi.org/10.1007/978-3-031-61716-4_5
Bogaerts BJakubowski M(2021)Fixpoint Semantics for Recursive SHACLElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.345.14345(41-47)Online publication date: 17-Sep-2021
https://doi.org/10.4204/EPTCS.345.14
Bogaerts BCruz-Filipe L(2021)Stratification in Approximation Fixpoint Theory and Its Application to Active Integrity ConstraintsACM Transactions on Computational Logic10.1145/343075022:1(1-19)Online publication date: 5-Jan-2021
https://dl.acm.org/doi/10.1145/3430750
De Wulf WBogaerts B(2020)LP2PB: Translating Answer Set Programs into Pseudo-Boolean TheoriesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.325.25325(206-219)Online publication date: 19-Sep-2020
https://doi.org/10.4204/EPTCS.325.25
Bogaerts BVennekens JDenecker M(2016)On Well-Founded Set-Inductions and Locally Monotone OperatorsACM Transactions on Computational Logic (TOCL)10.1145/296309617:4(1-32)Online publication date: 10-Sep-2016
https://dl.acm.org/doi/10.1145/2963096

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

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

Erratum to: "a new framework for declarative programming"

Adding the Everywhere Operator to Propositional Logic