Pages that link to "Item:Q1098651"
From MaRDI portal
The following pages link to On the computability of circumscription (Q1098651):
Displaying 6 items.
- Decidability and definability with circumscription (Q579240) (← links)
- Circumscription: Completeness reviewed (Q685339) (← links)
- On the satisfiability of circumscription (Q1073786) (← links)
- Computing circumscription revisited: A reduction algorithm (Q1367072) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Some computational aspects of circumscription (Q3474909) (← links)