Program Correspondence under the Answer-Set Semantics: The Non-ground Case
From MaRDI portal
Publication:5504682
Recommendations
- On structural analysis of non-ground answer-set programs
- Abstraction for non-ground answer set programs
- Abstraction for non-ground answer set programs
- scientific article; zbMATH DE number 6536279
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Answer set programming in intuitionistic logic
- The power of non-ground rules in Answer Set Programming
- A Tarskian informal semantics for answer set programming
- Semantical characterizations and complexity of equivalences in answer set programming
- Equivalence Between Answer-Set Programs Under (Partially) Fixed Input
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- A Characterization of Strong Equivalence for Logic Programs with Variables
- Circumscription - a form of non-monotonic reasoning
- Logic Programming
- Logic Programming
- Logics in Artificial Intelligence
- Logics in Artificial Intelligence
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- The DLV system for knowledge representation and reasoning
- Unfolding partiality and disjunctions in stable model semantics
Cited in
(6)- Exploring relations between answer set programs
- Abstraction for non-ground answer set programs
- Modular answer set programming as a formal specification language
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
- The power of non-ground rules in Answer Set Programming
- Model-based recasting in answer-set programming
This page was built for publication: Program Correspondence under the Answer-Set Semantics: The Non-ground Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504682)