Parametric modular answer set programs made declarative

DOI10.1017/S1471068426100520MaRDI QIDQ7406153zbMATH OpenFDO

Authors Jorge Fandinno, Yuliya Lierler, Torsten Schaub

Publication date 2026

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S1471068426100520

zbMATH Keywords

answer set programmingformal methodsmodularity

Mathematics Subject Classification ID

Logic programming (68N17)

Cites work

• A first order nonmonotonic extension of constructive logic
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• First-order modular logic programs and their conservative extensions
• Handbook of knowledge representation.
• Logics in Artificial Intelligence
• Modular answer set programming as a formal specification language
• Modularity Aspects of Disjunctive Stable Models
• Multi-shot ASP solving with clingo
• plasp 3: towards effective ASP planning
• Stable models and circumscription
• Transforming gringo rules into formulas in a natural way
• Verifying Tight Logic Programs with anthem and vampire

This page was built for publication: Parametric modular answer set programs made declarative

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