The following pages link to Alan Bundy (Q438542):
Displayed 50 items.
- Conjecture synthesis for inductive theories (Q438543) (← links)
- Automated theorem provers: a practical tool for the working mathematician? (Q657585) (← links)
- Automating Event-B invariant proofs by rippling and proof patching (Q667526) (← links)
- Rippling: A heuristic for guiding inductive proofs (Q685548) (← links)
- Proofs-as-programs as a framework for the design of an analogy-based ML editor (Q699921) (← links)
- Experiments with proof plans for induction (Q809617) (← links)
- On process equivalence = equation solving in CCS (Q839034) (← links)
- Attacking group protocols by refuting incorrect inductive conjectures (Q861695) (← links)
- An analytical comparison of some rule-learning programs (Q1069315) (← links)
- Correctness criteria of some algorithms for uncertain reasoning using incidence calculus (Q1101267) (← links)
- Explanation-based generalisation \(=\) partial evaluation (Q1109580) (← links)
- Solving symbolic equations with PRESS (Q1118401) (← links)
- Will it reach the top? Prediction in the mechanics world (Q1245585) (← links)
- Automating the synthesis of decision procedures in a constructive metatheory (Q1267772) (← links)
- Recursive program optimization through inductive synthesis proof transformation (Q1285864) (← links)
- On automating diagrammatic proofs of arithmetic arguments (Q1306168) (← links)
- Assignment methods for incidence calculus (Q1344260) (← links)
- Abstract proof checking: An example motivated by an incompleteness theorem (Q1373302) (← links)
- Item:Q438542 (redirect page) (← links)
- Calculating criticalities (Q1391896) (← links)
- Making a productive use of failure to generate witnesses for coinduction from divergent proof attempts (Q1601863) (← links)
- A general setting for flexibly combining and augmenting decision procedures (Q1610671) (← links)
- Constructing probabilistic ATMSs using extended incidence calculus (Q1809342) (← links)
- Incidence calculus: A mechanism for probabilistic reasoning (Q1820599) (← links)
- Planning proofs of equations in CCS (Q1857269) (← links)
- Productive use of failure in inductive proof (Q1915134) (← links)
- Middle-out reasoning for synthesis and induction (Q1915136) (← links)
- Automating change of representation for proofs in discrete mathematics (extended version) (Q2364883) (← links)
- Book review of: Robert Kowalski, Computational logic and human thinking: how to be artificially intelligent (Q2446588) (← links)
- A note on omitting the replacement schema (Q2555849) (← links)
- (Q2751365) (← links)
- (Q2753884) (← links)
- (Q2848040) (← links)
- (Q2852039) (← links)
- Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery (Q3058453) (← links)
- (Q3325029) (← links)
- (Q3327746) (← links)
- A generalized interval package and its use for semantic checking (Q3340043) (← links)
- Automating Change of Representation for Proofs in Discrete Mathematics (Q3453117) (← links)
- (Q3490990) (← links)
- Commentary on: solving symbolic equations with PRESS (Q3796738) (← links)
- (Q3804239) (← links)
- (Q3838801) (← links)
- (Q3880307) (← links)
- (Q4263161) (← links)
- (Q4264708) (← links)
- Automatic verification of functions with accumulating parameters (Q4267724) (← links)
- (Q4282519) (← links)
- (Q4484340) (← links)
- (Q4548193) (← links)