A polynomial reduction of forks into logic programs

DOI10.1016/J.ARTINT.2022.103712MaRDI QIDQ2144173zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1 June 2022

Published in Artificial Intelligence (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.artint.2022.103712

zbMATH Keywords

answer set programmingequilibrium logicnonmonotonic reasoningdenotational semanticsforgettingstrong equivalence

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Forgetting auxiliary atoms in forks
• Preserving strong equivalence while forgetting
• On the limits of forgetting in answer set programming
• Strongly equivalent logic programs
• Forgetting under the well-founded semantics

Cites work

• scientific article; zbMATH DE number 2090542 (Why is no real title available?)
• scientific article; zbMATH DE number 3099240 (Why is no real title available?)
• Forgetting auxiliary atoms in forks
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Semantical characterizations and complexity of equivalences in answer set programming
• Strongly equivalent logic programs
• You can't always forget what you want: on the limits of forgetting in answer set programming

Cited in

(1)

• Forgetting auxiliary atoms in forks

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: A polynomial reduction of forks into logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144173)