Pages that link to "Item:Q676419"
From MaRDI portal
The following pages link to Tie-breaking semantics and structural totality (Q676419):
Displaying 7 items.
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- Why not negation by fixpoint? (Q1176286) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- Functional queries in datalog (Q1862647) (← links)
- A nondeterministic well-founded semantics (Q1924729) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- Complexity of super-coherence problems in ASP (Q5418947) (← links)