First-order modular logic programs and their conservative extensions
From MaRDI portal
Publication:4593056
DOI10.1017/S1471068416000430zbMath1379.68067arXiv1608.02681OpenAlexW2488315955MaRDI QIDQ4593056
Amelia Harrison, Yuliya Lierler
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.02681
Related Items (3)
Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ Modular Answer Set Programming as a Formal Specification Language ⋮ On syntactic forgetting under uniform equivalence
Cites Work
- Stable models and circumscription
- Answer set programming and plan generation
- Performance Tuning in Answer Set Programming
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Weight constraints as nested expressions
- A Tarskian Informal Semantics for Answer Set Programming
- Knowledge Forgetting in Answer Set Programming
- A Characterization of Strong Equivalence for Logic Programs with Variables
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs
This page was built for publication: First-order modular logic programs and their conservative extensions
