Generality Relations in Answer Set Programming

DOI10.1007/11799573_17zbMATH Open1131.68379OpenAlexW1517369807MaRDI QIDQ5449602FDOQ5449602

Authors: Katsumi Inoue, Chiaki Sakama 

Publication date: 11 March 2008

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11799573_17

Recommendations

• Exploring relations between answer set programs
• Semantical characterizations and complexity of equivalences in answer set programming
• On the relations between stable and well-founded semantics of logic programs
• Expressiveness of logic programs under the general stable model semantics
• scientific article; zbMATH DE number 517025

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (4)

• Exploring relations between answer set programs
• First-order modular logic programs and their conservative extensions
• A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
• Static and dynamic orderings on Dungean argumentation frameworks -- an overview

This page was built for publication: Generality Relations in Answer Set Programming

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