Pages that link to "Item:Q1346715"
From MaRDI portal
The following pages link to Computing circumscriptive databases (Q1346715):
Displaying 11 items.
- Computing minimal models by partial instantiation (Q672131) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- An algorithm to compute circumscription (Q1115208) (← links)
- Inference flexibility in Horn clause knowledge bases and the simplex method (Q1319393) (← links)
- Computing definite logic programs by partial instantiation (Q1326778) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- Mixed integer programming methods for computing nonmonotonic deductive databases (Q4327631) (← links)
- A tableau calculus for minimal model reasoning (Q4645243) (← links)