Pages that link to "Item:Q3192208"
From MaRDI portal
The following pages link to The Complexity of Theorem Proving in Circumscription and Minimal Entailment (Q3192208):
Displaying 6 items.
- Proof complexity of modal resolution (Q832717) (← links)
- A tableau prover for domain minimization (Q1344878) (← links)
- The Complexity of Circumscriptive Inference in Post’s Lattice (Q3643126) (← links)
- (Q4418672) (← links)
- (Q4448378) (← links)
- Online Enumeration of All Minimal Inductive Validity Cores (Q6039387) (← links)