\begin{thebibliography}{}

\bibitem[\protect\citeauthoryear{Abts et~al.}{1998}]{cocomoII}
Abts, C., B. Clark, S. Devnani-Chulani, E. Horowitz, R. Madachy, D. Reifer, R.
  Selby, and B. Steece: 1998, `{COCOMO II} Model Definition Manual'.
\newblock Technical report, Center for Software Engineering, USC,.
\newblock \url{http://sunset.usc.edu/COCOMOII/cocomox.html#downloads}.

\bibitem[\protect\citeauthoryear{Agrawal and Srikant}{1994}]{agrawal94}
Agrawal, R. and R. Srikant: 1994, `Fast Algorithms for Mining Association
  Rules'.
\newblock In: {\em Proceedings of the 20th International Conference on Very
  Large Databases}.
\newblock Available from
  \url{http://www.almaden.ibm.com/cs/people/ragrawal/papers/vldb94_rj.ps}.

\bibitem[\protect\citeauthoryear{Bay and Pazzani}{1999}]{bay99}
Bay, S. and M. Pazzani: 1999, `Detecting Change in Categorical Data: Mining
  Contrast Sets'.
\newblock In: {\em Proceedings of the Fifth International Conference on
  Knowledge Discovery and Data Mining}.
\newblock Available from
  \url{http://www.ics.uci.edu/~pazzani/Publications/stucco.pdf}.

\bibitem[\protect\citeauthoryear{Breiman et~al.}{1984}]{breiman84}
Breiman, L., J.~H. Friedman, R.~A. Olshen, and C.~J. Stone: 1984,
  `Classification and Regression Trees'.
\newblock Technical report, Wadsworth International, Monterey, CA.

\bibitem[\protect\citeauthoryear{Cai et~al.}{1998}]{cai98}
Cai, C., A. Fu, C. Cheng, and W. Kwong: 1998, `Mining Association Rules with
  Weighted Items'.
\newblock In: {\em Proceedings of International Database Engineering and
  Applications Symposium (IDEAS 98)}.
\newblock Available from
  \url{http://www.cse.cuhk.edu.hk/~kdd/assoc_rule/paper.pdf}.

\bibitem[\protect\citeauthoryear{Clancy and Kuipers}{1997}]{clancy97}
Clancy, D. and B. Kuipers: 1997, `Model Decomposition and Simulation: A
  component based qualitative simulation algorithm'.
\newblock In: {\em AAAI-97}.

\bibitem[\protect\citeauthoryear{Crawford and Baker}{1994}]{crawford94}
Crawford, J. and A. Baker: 1994, `Experimental Results on the Application of
  Satisfiability Algorithms to Scheduling Problems'.
\newblock In: {\em AAAI '94}.

\bibitem[\protect\citeauthoryear{DeKleer}{1986}]{deKleer86}
DeKleer, J.: 1986, `An {A}ssumption-{B}ased {TMS}'.
\newblock {\em Artificial Intelligence} {\bf 28}, 163--196.

\bibitem[\protect\citeauthoryear{Feather et~al.}{2000}]{fea00}
Feather, M., S. Cornford, and T. Larson: 2000, `Combining the Best Attributes
  of Qualitative and Quantitative Risk Management Tool Support'.
\newblock In: {\em 15th IEEE International Conference on Automated Software
  Engineering, Grenoble, France}. pp. 309--312.

\bibitem[\protect\citeauthoryear{Feather and Menzies}{2002}]{fea02a}
Feather, M. and T. Menzies: 2002, `Converging on the Optimal Attainment of
  Requirements'.
\newblock In: {\em IEEE Joint Conference On Requirements Engineering ICRE'02
  and RE'02, 9-13th September, University of Essen, Germany}.
\newblock Available from \url{http://menzies.us/pdf/02re02.pdf}.

\bibitem[\protect\citeauthoryear{Holte}{1993}]{holte93}
Holte, R.: 1993, `Very Simple Classification Rules Perform Well on Most
  Commonly Used Datasets'.
\newblock {\em Machine Learning} {\bf 11}, 63.

\bibitem[\protect\citeauthoryear{Hu}{2003}]{hu02}
Hu, Y.: 2003, `Treatment Learning: Implementation and Application'.
\newblock Masters Thesis, Department of Electrical Engineering, University of
  British Columbia.

\bibitem[\protect\citeauthoryear{Josephson et~al.}{1998}]{joseph98}
Josephson, J., B. Chandrasekaran, M. Carroll, N. Iyer, B. Wasacz, and G.
  Rizzoni: 1998, `Exploration Of Large Design Spaces: an Architecture and
  Preliminary Results'.
\newblock In: {\em AAAI '98}.
\newblock Available from \url{http://www.cis.ohio-state.edu/~jj/Explore.ps}.

\bibitem[\protect\citeauthoryear{Kohavi and John}{1997}]{kohavi97}
Kohavi, R. and G.~H. John: 1997, `Wrappers for Feature Subset Selection'.
\newblock {\em Artificial Intelligence} {\bf 97}(1-2), 273--324.

\bibitem[\protect\citeauthoryear{Liu et~al.}{1998}]{liu98}
Liu, B., W. Hsu, and Y. Ma: 1998, `Integrating classification and association
  rule mining'.
\newblock In: {\em KDD}. pp. 80--86.
\newblock Available from
  \url{http://citeseer.nj.nec.com/liu98integrating.html}.

\bibitem[\protect\citeauthoryear{Lutz and Woodhouse}{1999}]{lutz99}
Lutz, R. and R. Woodhouse: 1999, `Bi-directional Analysis for Certification of
  Safety-Critical Software'.
\newblock In: {\em 1st International Software Assurance Certification
  Conference (ISACC'99)}.
\newblock Available from
  \url{http://www.cs.iastate.edu/~rlutz/publications/isacc99.ps}.

\bibitem[\protect\citeauthoryear{Madachy}{1997}]{madachy97}
Madachy, R.: 1997, `Heuristic Risk Assessment Using Cost Factors'.
\newblock {\em IEEE Software} {\bf 14}(3), 51--59.

\bibitem[\protect\citeauthoryear{Menzies and Compton}{1997}]{me97a}
Menzies, T. and P. Compton: 1997, `Applications of Abduction: Hypothesis
  Testing of Neuroendocrinological Qualitative Compartmental Models'.
\newblock {\em Artificial Intelligence in Medicine} {\bf 10}, 145--175.
\newblock Available from \url{http://menzies.us/pdf/96aim.pdf}.

\bibitem[\protect\citeauthoryear{Menzies and Cukic}{2000a}]{me00d}
Menzies, T. and B. Cukic: 2000a, `Adequacy of Limited Testing for Knowledge
  Based Systems'.
\newblock {\em International Journal on Artificial Intelligence Tools (IJAIT)}.
\newblock Available from \url{http://menzies.us/pdf/00ijait.pdf}.

\bibitem[\protect\citeauthoryear{Menzies and Cukic}{2000b}]{me99q}
Menzies, T. and B. Cukic: 2000b, `When to Test Less'.
\newblock {\em IEEE Software} {\bf 17}(5), 107--112.
\newblock Available from \url{http://menzies.us/pdf/00iesoft.pdf}.

\bibitem[\protect\citeauthoryear{Menzies et~al.}{2000}]{me00b}
Menzies, T., B. Cukic, H. Singh, and J. Powell: 2000, `Testing Nondeterminate
  Systems'.
\newblock In: {\em ISSRE 2000}.
\newblock Available from \url{http://menzies.us/pdf/00issre.pdf}.

\bibitem[\protect\citeauthoryear{Menzies et~al.}{1999}]{me99a}
Menzies, T., S. Easterbrook, B. Nuseibeh, and S. Waugh: 1999, `An Empirical
  Investigation of Multiple Viewpoint Reasoning in Requirements Engineering'.
\newblock In: {\em RE '99}.
\newblock Available from \url{http://menzies.us/pdf/99re.pdf}.

\bibitem[\protect\citeauthoryear{Menzies and Hu}{2001a}]{me01g}
Menzies, T. and Y. Hu: 2001a, `Constraining discussions in requirements
  engineering'.
\newblock In: {\em First International Workshop on Model-based Requirements
  Engineering}.
\newblock Available from \url{http://menzies.us/pdf/01lesstalk.pdf}.

\bibitem[\protect\citeauthoryear{Menzies and Hu}{2001b}]{me01f}
Menzies, T. and Y. Hu: 2001b, `Reusing models for requirements engineering'.
\newblock In: {\em First International Workshop on Model-based Requirements
  Engineering}.
\newblock Available from \url{http://menzies.us/pdf/01reusere.pdf}.

\bibitem[\protect\citeauthoryear{Menzies and Hu}{2002}]{me01h}
Menzies, T. and Y. Hu: 2002, `Agents in a Wild World'.
\newblock In: C. Rouff (ed.): {\em Formal Approaches to Agent-Based Systems,
  book chapter}.
\newblock Available from \url{http://menzies.us/pdf/01agents.pdf}.

\bibitem[\protect\citeauthoryear{Menzies and Hu}{2003}]{me03c}
Menzies, T. and Y. Hu: 2003, `Data Mining for Very Busy People'.
\newblock In: {\em IEEE Computer}.
\newblock Available from \url{http://menzies.us/pdf/03tar2.pdf}.

\bibitem[\protect\citeauthoryear{Menzies and Singh}{2001}]{me00t}
Menzies, T. and H. Singh: 2001, `Many Maybes Mean (Mostly) the Same Thing'.
\newblock In: {\em 2nd International Workshop on Soft Computing applied to
  Software Engineering (Netherlands), February}.
\newblock Available from \url{http://menzies.us/pdf/00maybe.pdf}.

\bibitem[\protect\citeauthoryear{Menzies and Singh}{2003}]{me03l}
Menzies, T. and H. Singh: 2003, `Many Maybes Mean (Mostly) the Same Thing'.
\newblock In: M. Madravio (ed.): {\em Soft Computing in Software Engineering}.
  Springer-Verlag.
\newblock Available from \url{http://menzies.us/pdf/03maybe.pdf}.

\bibitem[\protect\citeauthoryear{Menzies and Sinsel}{2000}]{me00e}
Menzies, T. and E. Sinsel: 2000, `Practical Large Scale What-if Queries: Case
  Studies with Software Risk Assessment'.
\newblock In: {\em Proceedings ASE 2000}.
\newblock Available from \url{http://menzies.us/pdf/00ase.pdf}.

\bibitem[\protect\citeauthoryear{Parkes}{1999}]{parkes99lifted}
Parkes, A.: 1999, `Lifted Search Engines for Satisfiability'.

\bibitem[\protect\citeauthoryear{Quinlan}{1992}]{quinlan92}
Quinlan, R.: 1992, {\em C4.5: Programs for Machine Learning}.
\newblock Morgan Kaufman.
\newblock ISBN: 1558602380.

\bibitem[\protect\citeauthoryear{Rymon}{1993}]{rymon93setree}
Rymon, R.: 1993, `An {SE}-tree based Characterization of the Induction
  Problem'.
\newblock In: {\em International Conference on Machine Learning}. pp. 268--275.

\bibitem[\protect\citeauthoryear{Rymon}{1994}]{rymon94an}
Rymon, R.: 1994, `An SE-tree-based Prime Implicant Generation Algorithm'.
\newblock In: {\em Annals of Math. and A.I., special issue on Model-Based
  Diagnosis}, Vol.~11.
\newblock Available from \url{http://citeseer.nj.nec.com/193704.html}.

\bibitem[\protect\citeauthoryear{Singer et~al.}{2000}]{singer00backbone}
Singer, J., I.~P. Gent, and A. Smaill: 2000, `Backbone Fragility and the Local
  Search Cost Peak'.
\newblock {\em Journal of Artificial Intelligence Research} {\bf 12}, 235--270.

\bibitem[\protect\citeauthoryear{Wang et~al.}{2001}]{wang00}
Wang, K., Y. He, D. Cheung, and F. Chin: 2001, `Mining confident rules without
  support requirement'.
\newblock In: {\em 10th ACM International Conference on Informationand
  Knowledge Management (CIKM 2001), Atlanta}.
\newblock Available from \url{http://www.cs.sfu.ca/~wangk/publications.html}.

\bibitem[\protect\citeauthoryear{Webb}{2000}]{webb00}
Webb, G.: 2000, `Efficient search for association rules'.
\newblock In: {\em Proceeding of KDD-2000 Boston, MA}.
\newblock Available from \url{http://citeseer.nj.nec.com/webb00efficient.html}.

\end{thebibliography}