Modularity Aspects of Disjunctive Stable Models

DOI10.1007/978-3-540-72200-7_16zbMath1149.68334arXiv1401.3484OpenAlexW2108736148MaRDI QIDQ5425407

Stefan Woltran, Tomi Janhunen, Emilia Oikarinen, Hans Tompits

Publication date: 13 November 2007

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

Full work available at URL: https://arxiv.org/abs/1401.3484

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (8)

On abstract modular inference systems and solvers ⋮ Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ Implementing Prioritized Circumscription by Computing Disjunctive Stable Models ⋮ Modular Nonmonotonic Logic Programming Revisited ⋮ Answer Set Programming: A Primer ⋮ Relativized hyperequivalence of logic programs for modular programming ⋮ Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There ⋮ Relativized Hyperequivalence of Logic Programs for Modular Programming

Uses Software

• ASSAT

This page was built for publication: Modularity Aspects of Disjunctive Stable Models