Characterising relativised strong equivalence with projection for non-ground answer-set programs

DOI10.1007/978-3-030-19570-0_36OpenAlexW2943936533MaRDI QIDQ2296744FDOQ2296744

Authors: Tobias Geibinger, Hans Tompits 

Publication date: 18 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-19570-0_36

Recommendations

• Logics in Artificial Intelligence
• Semantical characterizations and complexity of equivalences in answer set programming
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case
• Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
• A common view on strong, uniform, and other notions of equivalence in answer-set programming

zbMATH Keywords

answer-set programmingprogram equivalencemodel-theoretic characterisations

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cited In (2)

• Abstraction for non-ground answer set programs
• Modular answer set programming as a formal specification language

This page was built for publication: Characterising relativised strong equivalence with projection for non-ground answer-set programs

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