Pages that link to "Item:Q622117"
From MaRDI portal
The following pages link to Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117):
Displayed 10 items.
- Evaluating epistemic negation in answer set programming (Q286399) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- Forgetting in ASP: The Forgotten Properties (Q2835900) (← links)
- Well-Supported Semantics for Logic Programs with Generalized Rules (Q2900549) (← links)
- Model-based recasting in answer-set programming (Q4583308) (← links)
- Stepwise debugging of answer-set programs (Q4603428) (← links)
- Inlining External Sources in Answer Set Programs (Q4957183) (← links)
- Relating Two Dialects of Answer Set Programming (Q5108518) (← links)