Pages that link to "Item:Q5277782"
From MaRDI portal
The following pages link to Semantical characterizations and complexity of equivalences in answer set programming (Q5277782):
Displaying 29 items.
- Characterizing strong equivalence for argumentation frameworks (Q420788) (← links)
- On graph equivalences preserved under extensions (Q536221) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- Strong order equivalence (Q854968) (← links)
- Equivalence between answer-set programs under (partially) fixed input (Q1783736) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- A polynomial reduction of forks into logic programs (Q2144173) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Query inseparability for \(\mathcal{ALC}\) ontologies (Q2321290) (← links)
- A general notion of equivalence for abstract argumentation (Q2321336) (← links)
- Forgetting auxiliary atoms in forks (Q2321342) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach (Q2642629) (← links)
- Interlinking logic programs and argumentation frameworks (Q2694581) (← links)
- Applying Visible Strong Equivalence in Answer-Set Program Transformations (Q2900532) (← links)
- Preserving Strong Equivalence while Forgetting (Q2938510) (← links)
- Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
- Well-Founded and Partial Stable Semantics Logical Aspects (Q3392936) (← links)
- Formal Properties of Modularisation (Q3631354) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Relativized hyperequivalence of logic programs for modular programming (Q3648358) (← links)
- Model-based recasting in answer-set programming (Q4583308) (← links)
- Dual-normal logic programs – the forgotten class (Q4592993) (← links)
- Fuzzy answer set computation via satisfiability modulo theories (Q4592999) (← links)
- Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There (Q5504650) (← links)
- Relativized Hyperequivalence of Logic Programs for Modular Programming (Q5504681) (← links)
- (Q5856406) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)
