Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs

DOI10.1017/S147106840800358XzbMath1156.68012MaRDI QIDQ3546042

Tomi Janhunen, Emilia Oikarinen

Publication date: 18 December 2008

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

answer set programmingmodule systemcompositional semanticsstable model semanticsmodular equivalence

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (15)

An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ Solving Disjunctive Fuzzy Answer Set Programs ⋮ Applying Visible Strong Equivalence in Answer-Set Program Transformations ⋮ Connecting First-Order ASP and the Logic FO(ID) through Reducts ⋮ A framework for modular ERDF ontologies ⋮ A model building framework for answer set programming with external computations ⋮ First-order modular logic programs and their conservative extensions ⋮ Stable models for infinitary formulas with extensional atoms ⋮ Characterizing strong equivalence for argumentation frameworks ⋮ Weight constraint programs with evaluable functions ⋮ Modular Nonmonotonic Logic Programming Revisited ⋮ Stable models and circumscription ⋮ On syntactic forgetting under uniform equivalence ⋮ Answer Set Programming: A Primer ⋮ Graph-based construction of minimal models

Uses Software

• ASSAT
• Smodels
• clasp

Cites Work

• Transformations of CLP modules
• Logic programming and knowledge representation---The A-Prolog perspective
• Extending and implementing the stable model semantics
• Building a knowledge base: An example
• Logic programs with stable model semantics as a constraint programming paradigm
• Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs
• Autoepistemic logic
• Structuring logic programs: a modal approach
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Weight constraints as nested expressions
• A logical analysis of modules in logic programming
• Modularity in smodels Programs
• TOAST: Applying Answer Set Programming to Superoptimisation
• Temporal phylogenetic networks and logic programming

This page was built for publication: Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs