Leibniz

The Leibniz System is a software package for the development and implementation of logic-based intelligent systems. The package covers various aspect of the construction of such systems with modules for: - logic computation - learning logic formulas from data - discretization of data - subgroup discovery from data - data estimation by a lazy learner - dimension reduction of models - decomposition of graphs and matrices - solution of constrained optimization problems involving single or multiple objective functions. All programs are written in C using the ANSI standard. Installation is intended under Linux/Unix. Installation using other operating systems should not be difficult but is not covered in the manual.


References in zbMATH (referenced in 31 articles , 2 standard articles )

Showing results 21 to 31 of 31.
Sorted by year (citations)
  1. Cornuéjols, Gérard; Guenin, Bertrand: Ideal clutters (2002)
  2. Felici, Giovanni; Truemper, Klaus: A MINSAT approach for learning in logic domains (2002)
  3. Formica, Anna; Frank, Heinz: Consistency of the static and dynamic components of object-oriented specifications (2002)
  4. Bruni, Renato; Sassano, Antonio: Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae (2001)
  5. Courcelle, B.; Makowsky, J. A.; Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (2001)
  6. Ibaraki, Toshihide; Kogan, Alexander; Makino, Kazuhisa: On functional dependencies in (q)-Horn theories (2001)
  7. Franco, John: Some interesting research directions in satisfiability (2000)
  8. Franco, John; Goldsmith, Judy; Schlipf, John; Speckenmeyer, Ewald; Swaminathan, R. P.: An algorithm for the class of pure implicational formulas (1999)
  9. Franco, John V. (ed.); Gallo, Giorgio (ed.); Kleine Büning, Hans (ed.); Speckenmeyer, Ewald (ed.); Boros, Endre (ed.); Hammer, Peter L. (ed.): Special issues on The satisfiability problem (pp. 1--244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29--May 3, 1996 and Boolean functions (pp. 245--479) (1999)
  10. Truemper, Klaus: Effective logic computation (1998)
  11. Franco, J.: Relative size of certain polynomial time solvable subclasses of satisfiability (1997)