Pages that link to "Item:Q4365319"
From MaRDI portal
The following pages link to Deterministic and non-deterministic stable models (Q4365319):
Displaying 14 items.
- Approximating operators and semantics for abstract dialectical frameworks (Q490444) (← links)
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- Fundamental properties of deterministic and nondeterministic extensions of Datalog (Q756410) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Multiple total stable models are definitely needed to solve unique solution problems (Q1349967) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)
- Functional queries in datalog (Q1862647) (← links)
- A description of autostable models (Q2709295) (← links)
- Deterministic models and identification of their parameters (Q3117999) (← links)
- P-stable models of strong kernel programs (Q3631321) (← links)
- Stable models are generated by a stable chain (Q4365060) (← links)
- (Q4849445) (← links)
- A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness (Q6066787) (← links)