Modular nonmonotonic logic programming revisited

DOI10.1007/978-3-642-02846-5_16zbMATH Open1251.68056DBLPconf/iclp/Dao-TranEFK09OpenAlexW1511906506WikidataQ57549127 ScholiaQ57549127MaRDI QIDQ4649729FDOQ4649729

Authors: Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas Krennwallner 

Publication date: 13 November 2012

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02846-5_16

Recommendations

• Promoting modular nonmonotonic logic programs
• Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
• Modularity aspects of disjunctive stable models
• Modularity in smodels Programs
• Modularity Aspects of Disjunctive Stable Models

zbMATH Keywords

answer set programmingknowledge representationmodular logic programming

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Cites Work

• Title not available (Why is that?)
• Modularity Aspects of Disjunctive Stable Models
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Logics in Artificial Intelligence
• Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming
• Title not available (Why is that?)

Cited In (25)

• Semi-equilibrium models for paracoherent answer set programs
• Relativized hyperequivalence of logic programs for modular programming
• Answer Set Programming: A Primer
• Promoting modular nonmonotonic logic programs
• Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming
• On abstract modular inference systems and solvers
• Modularity aspects of disjunctive stable models
• Modular paracoherent answer sets
• Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
• Module theorem for the general theory of stable models
• Semantics of templates in a compositional framework for building logics
• Composing Normal Programs with Function Symbols
• Modularity of P-log programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ordered completion for logic programs with aggregates
• On syntactic forgetting under uniform equivalence
• How to split a logic program
• Modular answer set programming as a formal specification language
• FLP answer set semantics without circular justifications for general logic programs
• Determining inference semantics for disjunctive logic programs
• Combining nonmonotonic knowledge bases with external sources
• Modularity in smodels Programs
• Modularity Aspects of Disjunctive Stable Models
• Graph-based construction of minimal models

This page was built for publication: Modular nonmonotonic logic programming revisited

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