Pages that link to "Item:Q1924729"
From MaRDI portal
The following pages link to A nondeterministic well-founded semantics (Q1924729):
Displaying 13 items.
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- Fundamental properties of deterministic and nondeterministic extensions of Datalog (Q756410) (← links)
- Argumentation in disjunctive logic programming (Q1129838) (← links)
- Credolous argumentation with the disjunctive stable semantics (Q1267224) (← links)
- A semantics for a class of non-deterministic and causal production system programs (Q1340964) (← links)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)
- (Q3713578) (← links)
- Equivalence of well-founded and stable semantics (Q4311649) (← links)
- A Principle-Based Analysis of Weakly Admissible Semantics (Q5145809) (← links)
- (Q5446288) (← links)
- A constructive semantics for non‐deducibility (Q5448614) (← links)
- A tutorial on the well-founded semantics (Q5930853) (← links)