Pages that link to "Item:Q1924783"
From MaRDI portal
The following pages link to Complexity of computing with extended propositional logic programs (Q1924783):
Displaying 10 items.
- FC-normal and extended stratified logic program (Q865986) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- A topological characterization of the stable and minimal model classes of propositional logic programs (Q1924782) (← links)
- Propositional semantics for disjunctive logic programs (Q1924819) (← links)
- Skeptical reasoning in FC-normal logic programs is \(\Pi_1^1\)-complete (Q2711328) (← links)
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255) (← links)
- (Q3393869) (← links)
- (Q3827989) (← links)
- (Q4244295) (← links)
- Fixed-parameter complexity of semantics for logic programs (Q5267425) (← links)