System Description: Kimba, A Model Generator for Many-Valued First-Order Logics

  • Karsten Konrad
  • D. A. Wolfram
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1632)


Kimba is the first model generation program which implements a semi-decision procedure for nite satisability of rst-order logics with nitely many truth values. The procedure enumerates the nite models of its input and can be used to compute efficiently domain minimal models whose positive part is minimal in size. Kimba has been implemented in the constraint logic programming language Oz [6] and is based on a tableaux calculus that translates deduction problems into Constraint Satisfaction Problems (CSPs). The constraint propagators needed to solve these problems are realized as concurrent procedures that can make use of Oz’s built-in capabilities for solving CSPs.

We describe the current prototype focusing on the method for generating and solving CSPs.


Constraint Satisfaction Problem Integer Variable Positive Literal Tableau System Concurrent Procedure 
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.
    B. Beckert, R. Hähnle, P. Oel, and M. Sulzmann. The tableau-based theorem prover 3 T A P, version 4.0. In M. McRobbie and J. Slaney, editors, Proc., 13th International Conference on Automated Deduction (CADE), New Brunswick, NJ, USA, LNCS 1104. Springer, 1996.Google Scholar
  2. 2.
    R. Hähnle. Many-valued logic and mixed integer programming. Annals of Mathematics and Artificial Intelligence, 12(3,4):231–264, Dec. 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    R. Hasegawa. Model generation theorem provers and their applications. In L. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 7–8, Cambridge, MA, USA, June13-18 1995. MIT Press.Google Scholar
  4. 4.
    M. Kerber and M. Kohlhase. A mechanization of strong Kleene logic for partial functions. SEKI-Report SR-93-20 (SFB), Universität des Saarlandes, Saarbrücken, 1993.Google Scholar
  5. 5.
    K. Konrad and D. A. Wolfram. Finite model generation for many-valued higherorder logics. Forthcoming, 1999.Google Scholar
  6. 6.
    Programming Systems Lab Saarbrücken, 1998. Oz Webpage:
  7. 7.
    J. Slaney. FINDER (Finite Domain Enumerator): Notes and guide. Technical Report TR-ARP-1/92, Australian National University Automated Reasoning Project, Canberra, 1992.Google Scholar
  8. 8.
    C. Suttner and G. Sutcliffe. The TPTP problem library (TPTP v2.2.0). Technical Report 97-04, Department of Computer Science, James Cook University, Townsville, Australia, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Karsten Konrad
    • 1
  • D. A. Wolfram
    • 2
  1. 1.Fachbereich InformatikUniversität des SaarlandesGermany
  2. 2.Department of Computer ScienceThe Australian National UniversityAustralia

Personalised recommendations