System Description: MCS: Model-Based Conjecture Searching

  • Jian Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1632)


An enumerative approach to conjecture formulation is presented. Its basic steps include the generation of terms and formulas, and testing the formulas in a set of models. The main procedure and some experimental results are described.


System Description Theorem Prover Automate Reasoning Automate Theorem Automate Theorem Prover 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Russell, S. and Norvig, P., Artificial Intelligence: A Modern Approach, Prentice Hall, Englewood Cliffs, New Jersey, USA, 1995.zbMATHGoogle Scholar
  2. 2.
    Schumann, J.M.Ph., “DELTA-A bottom-up preprocessor for top-down theorem provers,” Proc. CADE-12, 774–777, 1994.Google Scholar
  3. 3.
    Slaney, J. et al. “Automated reasoning and exhaustive search: Quasigroup existence problems,” Computers and Math. with Applications 29(2): 115–132, 1995.zbMATHCrossRefGoogle Scholar
  4. 4.
    Wos, L., Automated Reasoning: 33 Basic Research Problems, Prentice Hall, Englewood Cliffs, New Jersey, USA, 1988.Google Scholar
  5. 5.
    Zhang, J., The Generation and Applications of Finite Models, PhD thesis, Institute of Software, Chinese Academy of Sciences, Beijing, China, 1994.Google Scholar
  6. 6.
    Zhang, J., “Constructing finite algebras with FALCON,” J. Automated Reasoning 17(1): 1–22, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Jian Zhang
    • 1
  1. 1.Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijingCHINA

Personalised recommendations