Pages that link to "Item:Q5267425"
From MaRDI portal
The following pages link to Fixed-parameter complexity of semantics for logic programs (Q5267425):
Displaying 12 items.
- The computational complexity of ideal semantics (Q1045987) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- Fixpoint semantics for logic programming a survey (Q1605173) (← links)
- On the complexity of formulas in semantic programming (Q1615728) (← links)
- Complexity of computing with extended propositional logic programs (Q1924783) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- On the complexity of the partner units decision problem (Q2407462) (← links)
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs (Q2900518) (← links)
- The complexity of revising logic programs (Q4262832) (← links)
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Q5019599) (← links)
- (Q5711171) (← links)