Modularity Aspects of Disjunctive Stable Models
From MaRDI portal
Publication:3651481
DOI10.1613/jair.2810zbMath1192.68129OpenAlexW3103989664MaRDI QIDQ3651481
Stefan Woltran, Hans Tompits, Emilia Oikarinen, Tomi Janhunen
Publication date: 10 December 2009
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.2810
Related Items (25)
Backdoors to Normality for Disjunctive Logic Programs ⋮ Online Action Language $$o\mathcal {BC}$$+ ⋮ ASP Solving for Expanding Universes ⋮ Parameterized Splitting: A Simple Modification-Based Approach ⋮ Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs ⋮ Applying Visible Strong Equivalence in Answer-Set Program Transformations ⋮ A Semantic Account for Modularity in Multi-language Modelling of Search Problems ⋮ An analysis of the equational properties of the well-founded fixed point ⋮ A framework for modular ERDF ontologies ⋮ Modular Paracoherent Answer Sets ⋮ A model building framework for answer set programming with external computations ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Partial Compilation of ASP Programs ⋮ On updates of hybrid knowledge bases composed of ontologies and rules ⋮ On the limits of forgetting in answer set programming ⋮ Unnamed Item ⋮ On the input/output behavior of argumentation frameworks ⋮ Equivalence between answer-set programs under (partially) fixed input ⋮ Pruning external minimality checking for answer set programs using semantic dependencies ⋮ On syntactic forgetting under uniform equivalence ⋮ Testing in ASP: revisited language and programming environment ⋮ Answers set programs for non-transferable utility games: expressiveness, complexity and applications ⋮ A general notion of equivalence for abstract argumentation ⋮ Graph-based construction of minimal models ⋮ Semi-equilibrium models for paracoherent answer set programs
Uses Software
This page was built for publication: Modularity Aspects of Disjunctive Stable Models
