Pages that link to "Item:Q1367083"
From MaRDI portal
The following pages link to The use of lemmas in the model elimination procedure (Q1367083):
Displaying 12 items.
- First order Stålmarck. Universal lemmas through branch merges (Q1040785) (← links)
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- The resonance strategy (Q1343396) (← links)
- Clause trees: A tool for understanding and implementing resolution in automated reasoning (Q1402732) (← links)
- Persistent and quasi-persistent lemmas in propositional model elimination (Q1430298) (← links)
- Evaluating general purpose automated theorem proving systems (Q1606324) (← links)
- On terminating lemma speculations. (Q1854370) (← links)
- Lemma and cut strategies for propositional model elimination (Q1978019) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- An Implementation of the Model Elimination Proof Procedure (Q4770008) (← links)
- Lemma matching for a PTTP-based top-down theorem prover (Q5234698) (← links)
- Controlled use of clausal lemmas in connection tableau calculi (Q5927985) (← links)