The following pages link to Stable models and circumscription (Q543596):
Displayed 14 items.
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- John McCarthy's legacy (Q543573) (← links)
- On elementary loops of logic programs (Q2884258) (← links)
- Lifschitz and Circumscription (Q2900534) (← links)
- Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming (Q2900536) (← links)
- Connecting First-Order ASP and the Logic FO(ID) through Reducts (Q2900547) (← links)
- Well-Supported Semantics for Logic Programs with Generalized Rules (Q2900549) (← links)
- Representing first-order causal theories by logic programs (Q2909525) (← links)
- Relational theories with null values and non-herbrand stable models (Q4911135) (← links)
- Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (Q4911144) (← links)
- Module theorem for the general theory of stable models (Q4911145) (← links)
- Lloyd-Topor completion and general stable models (Q5398291) (← links)
- Disjunctive logic programs with existential quantification in rule heads (Q5398295) (← links)
- On the stable model semantics for intensional functions (Q5398316) (← links)