Report
 Date
 Title

EDIINFRR1378
 2010
 Properties of IsaCoSy's Constraint Generation Algorithm

EDIINFRR1377
 2010
 Ideas for a highlevel proof strategy language

EDIINFRR1347
 Sep 2009
 Learning from experts to aid the automation of proof search

EDIINFRR1328
 Mar 2009
 On Process Equivalence = Equation Solving in CCS

EDIINFRR1326
 2009
 CaseAnalysis for Rippling and Inductive Proof

EDIINFRR1314
 Nov 2008
 Inconstancy: An Ontology Repair Plan for Adding Hidden Variables

EDIINFRR1312
 Sep 2004
 The Paradox of the Case Study

EDIINFRR1311
 2002
 A Critique of Proof Planning

EDIINFRR1271
 Jul 2008
 Automating Signature Evolution in Logical Theories

EDIINFRR1264
 Jul 2008
 Towards Ontology Evolution in Physics

EDIINFRR1257
 Feb 2005
 Psychological validity of schematic proofs

EDIINFRR1247
 2007
 Automatic synthesis of decision procedures

EDIINFRR1246
 2007
 Fast, but Approximate, WorkflowRuntime Estimation Using the BellCurve Calculus

EDIINFRR1245
 2007
 Computational Thinking is Pervasive

EDIINFRR1225
 Jul 2007
 Where's My Stuff? An Ontology Repair Plan

EDIINFRR1149
 2007
 Dynamic, automatic, firstorder ontology repair by diagnosis of failed plan execution

EDIINFRR1097
 Jul 2007
 Automated discovery of inductive theorems.

EDIINFRR1069
 Mar 2006
 Towards a BellCurve Calculus and its Application to eScience

EDIINFRR1068
 Sep 2006
 Towards a BellCurve Calculus for eScience

EDIINFRR0989
 Nov 2005
 Automatic Verification of Design Patterns in Java

EDIINFRR0954
 Jan 2007
 Cooperating Reasoning Processes: More than Just the Sum of their Parts

EDIINFRR0869
 Oct 2005
 What is a proof?

EDIINFRR0849
 Aug 2006
 BestFirst Rippling

EDIINFRR0842
 Sep 2006
 Towards a BellCurve Calculus for eScience

EDIINFRR0841
 Jul 2006
 Constructing, Selecting and Repairing Representations of Knowledge

EDIINFRR0837
 May 2006
 On Repairing Reasoning Reversals via Representational Refinements

EDIINFRR0836
 May 2006
 Representation as a Fluent: An AI Challenge for the Next Half Century

EDIINFRR0831
 2006
 A Very Mathematical Dilemma

EDIINFRR0786
 2006
 Planning as Deductive Synthesis in Intuitionistic Linear Logic

EDIINFRR0564
 2006
 Ascertaining Mathematical Theorems

EDIINFRR0491
 2005
 Constructing Induction Rules for Deductive Synthesis Proofs

EDIINFRR0394
 Oct 2005
 The Nature of Mathematical Proof

EDIINFRR0348
 2004
 An Experimental Comparison of Diagrammatic and Algebraic Logics

EDIINFRR0331
 2002
 Using Animation in Diagrammatic Theorem Proving

EDIINFRR0315
 Jun 2005
 Rippling: MetaLevel Guidance for Mathematical Reasoning

EDIINFRR0291
 Sep 2000
 A Proposal for Automating Diagrammatic Reasoning in Continuous Domains

EDIINFRR0270
 2004
 Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures

EDIINFRR0269
 2004
 Attacking Group Multicast Key Management Protocols Using CORAL

EDIINFRR0268
 Jan 2006
 Attacking Group Protocols by Refuting Incorrect Inductive Conjectures

EDIINFRR0253
 Dec 2003
 Plan Execution Failure Analysis Using Plan Deconstruction

EDIINFRR0252
 Dec 2004
 An Automatic Translator from KIF to PDDL

EDIINFRR0251
 Jul 2004
 Diagnosing and Repairing Ontological Mismatches

EDIINFRR0245
 Jun 2004
 Facilitating Agent Communication through Detecting, Diagnosing and Refining Ontological Mismatch

EDIINFRR0244
 Jun 2005
 Planning from rich ontologies through translation betweeen representations

EDIINFRR0229
 Jul 2004
 Planning and Patching Proof

EDIINFRR0182
 Sep 2001
 On the correction of faulty formulae

EDIINFRR0179
 Oct 2003
 Attacking the AsokanGinzboorg Protocol for Key Distribution in an AdHoc Bluetooth Network Using CORAL

EDIINFRR0177
 Jun 2003
 Dynamic Ontology Refinement

EDIINFRR0141
 Jul 2002
 Finding Counterexamples to Inductive Conjectures and Discovering Security Protocol Attacks

EDIINFRR0103
 Feb 2001
 Applying adversarial planning techniques to Go

EDIINFRR0098
 Jan 1999
 Extensions to the Estimation Calculus

EDIINFRR0097
 Jan 2001
 Strict General Setting for Building Decision Procedures into Theorem Provers

EDIINFRR0096
 Jan 1999
 A Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers

EDIINFRR0095
 Jan 2002
 A General Setting for Flexibly Combining and Augmenting Decision Procedures

EDIINFRR0019
 May 2000
 Cross Domain Mathematical Concept Formation

EDIINFRR0004
 1999
 Making a Productive Use of Failure to Generate Witnesses for Coinduction from Divergent Proof Attempts

EDIINFRR0003
 Sep 1999
 Proofs About Lists Using Ellipsis

EDIINFRR0002
 Apr 1999
 The Automation Of Proof By Mathematical Induction

EDIINFRR0001
 Apr 1999
 A Survey of Automated Deduction
