Modularity in smodels Programs

DOI10.1007/978-3-540-72200-7_33MaRDI QIDQ5425415zbMATH OpenOpenAlexFDO

Authors Emilia Oikarinen

Publication date 13 November 2007

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72200-7_33

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Modularity aspects of disjunctive stable models
• Modular nonmonotonic logic programming revisited
• A semantics for modular general logic programs
• Modularity Aspects of Disjunctive Stable Models

Cited in

(15)

• A semantics for modular general logic programs
• Modular paracoherent answer sets
• Integrating library modules into Pascal programs
• A Translation-based Approach to the Verification of Modular Equivalence
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
• Modularity aspects of disjunctive stable models
• scientific article; zbMATH DE number 1231620 (Why is no real title available?)
• Modular nonmonotonic logic programming revisited
• Module theorem for the general theory of stable models
• scientific article; zbMATH DE number 7455722 (Why is no real title available?)
• Modularity Aspects of Disjunctive Stable Models
• Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming
• Composing Normal Programs with Function Symbols
• Removing Redundancy from Answer Set Programs

This page was built for publication: Modularity in smodels Programs

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