How to split a logic program

DOI10.4204/EPTCS.345.13MaRDI QIDQ6647305zbMATH OpenFDO

Authors Rachel Ben-Eliyahu-Zohary

Publication date 3 December 2024

Full work available at URL https://doi.org/10.4204/EPTCS.345.13

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Parameterized splitting: a simple modification-based approach
• scientific article; zbMATH DE number 1292288
• The splitting property of stable models
• Optimizing answer set computation via heuristic-based decomposition
• Better paracoherent answer sets with less resources

Cites work

• A machine program for theorem-proving
• A note on two problems in connexion with graphs
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Engineering an Incremental ASP Solver
• Generating hard satisfiability problems
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• Modular nonmonotonic logic programming revisited
• Modularity aspects of disjunctive stable models
• Parameterized splitting: a simple modification-based approach
• Propositional semantics for disjunctive logic programs
• Splitting an Argumentation Framework

This page was built for publication: How to split a logic program

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