Pages that link to "Item:Q3702535"
From MaRDI portal
The following pages link to Computing protected circumscription (Q3702535):
Displaying 6 items.
- Protected completions of first-order general logic programs (Q911800) (← links)
- Completeness results for circumscription (Q1073787) (← links)
- Inferring negative information from disjunctive databases (Q1114440) (← links)
- Relating minimal models and pre-requisite-free normal defaults (Q1205716) (← links)
- Dynamic reasoning with qualified syllogisms (Q1402719) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
