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 28 articles , 1 standard article )

Showing results 1 to 20 of 28.
Sorted by year (citations)

1 2 next

  1. Chen, Vinciane; Rao, Angeline; Rusnak, Lucas J.; Yang, Alex: A characterization of oriented hypergraphic balance via signed weak walks (2015)
  2. Rusnak, Lucas J.: Oriented hypergraphs: introduction and balance (2013)
  3. Walter, Matthias; Truemper, Klaus: Implementation of a unimodularity test (2013)
  4. Crama, Yves; Hammer, Peter L.: Boolean functions. Theory, algorithms, and applications (2011)
  5. Bruni, Renato: A logic-based approach to polymer sequence analysis (2010)
  6. Haus, Utz-Uwe; Truemper, Klaus; Weismantel, Robert: Linear satisfiability algorithm for 3CNF formulas of certain signaling networks (2009)
  7. Bruni, Renato: Solving peptide sequencing as satisfiability (2008)
  8. Bruni, Renato; Santori, Andrea: New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (2008)
  9. Conforti, Michele; Cornuéjols, Gérard; Vušković, Kristina: Balanced matrices (2006)
  10. Bruni, Renato: On exact selection of minimally unsatisfiable subformulae (2005)
  11. Pretolani, Daniele: Probability logic and optimization SAT: The PSAT and CPA models (2005)
  12. Bruni, Renato: Solving error correction for large data sets by means of a SAT solver (2004)
  13. Dasgupta, Sudeshna; Chandru, Vijay: Minimal unsatisfiable sets: Classification and bounds (2004)
  14. Bruni, Renato: Approximating minimal unsatisfiable subformulae by means of adaptive core search (2003)
  15. Bruni, Renato; Sassano, Antonio: A complete adaptive algorithm for propositional satisfiability (2003)
  16. Franco, John; Van Gelder, Allen: A perspective on certain polynomial-time solvable classes of satisfiability (2003)
  17. Plaisted, David A.; Biere, Armin; Zhu, Yunshan: A satisfiability procedure for quantified Boolean formulae (2003)
  18. Cornuéjols, Gérard; Guenin, Bertrand: Ideal clutters (2002)
  19. Felici, Giovanni; Truemper, Klaus: A MINSAT approach for learning in logic domains (2002)
  20. Formica, Anna; Frank, Heinz: Consistency of the static and dynamic components of object-oriented specifications (2002)

1 2 next