Pages that link to "Item:Q1199545"
From MaRDI portal
The following pages link to The relationship between stable, supported, default and autoepistemic semantics for general logic programs (Q1199545):
Displayed 10 items.
- Computing minimal models by partial instantiation (Q672131) (← links)
- Tie-breaking semantics and structural totality (Q676419) (← links)
- How complicated is the set of stable models of a recursive logic program? (Q1192346) (← links)
- Stable and extension class theory for logic programs and default logics (Q1197387) (← links)
- Autoepistemic logic programming (Q1344887) (← links)
- An alternative approach to the semantics of disjunctive logic programs and deductive databases (Q1344892) (← links)
- SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs (Q1350529) (← links)
- Disjunctive \(LP+\) integrity constraints = stable model semantics. (Q1353944) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)