The following pages link to Theorem proving with abstraction (Q1149799):
Displaying 22 items.
- A relevance restriction strategy for automated deduction (Q814429) (← links)
- Octopus: combining learning and parallel search (Q861370) (← links)
- Man-machine theorem proving in graph theory (Q1104124) (← links)
- Speeding up inferences using relevance reasoning: a formalism and algorithms (Q1127352) (← links)
- A simplified problem reduction format (Q1170894) (← links)
- Reasoning about model accuracy (Q1199915) (← links)
- A theory of abstraction (Q1199923) (← links)
- On an unsatisfiability-satisfiability prover (Q1264000) (← links)
- Conceptual fuzzy sets and their connectives (Q1304223) (← links)
- The inevitability of inconsistent abstract spaces (Q1311395) (← links)
- Frameworks for abstract interpretation (Q1323307) (← links)
- Automatically generating abstractions for planning (Q1332851) (← links)
- Downward refinement and the efficiency of hierarchical problem solving (Q1341665) (← links)
- Data abstractions for decision tree induction (Q1870535) (← links)
- Proving theorems by reuse (Q1978233) (← links)
- Towards a practical theory of reformulation for reasoning about physical systems (Q2457693) (← links)
- Interpreting Abstract Interpretations in Membership Equational Logic (Q2841246) (← links)
- First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation (Q2964455) (← links)
- Detecting non-provable goals (Q5210774) (← links)
- Building proofs or counterexamples by analogy in a resolution framework (Q5235252) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)
- Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs (Q6053407) (← links)
