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 33 articles , 2 standard articles )

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

1 2 next

  1. Gurjar, Rohit; Thierauf, Thomas; Vishnoi, Nisheeth K.: Isolating a vertex via lattices: polytopes with totally unimodular faces (2021)
  2. Boccia, Maurizio; Sforza, Antonio; Sterle, Claudio: Simple pattern minimality problems: integer linear programming formulations and covering-based heuristic solving approaches (2020)
  3. Bertolim, Maria A.; Lima, Dahisy V. S.; Mello, Margarida P.; de Rezende, Ketty A.; da Silveira, Mariana R.: Algebraic and dynamical cancellations associated to spectral sequence (2017)
  4. Papalamprou, Konstantinos; Pitsoulis, Leonidas S.: Signed-graphic matroids with all-graphic cocircuits (2017)
  5. Chen, Vinciane; Rao, Angeline; Rusnak, Lucas J.; Yang, Alex: A characterization of oriented hypergraphic balance via signed weak walks (2015)
  6. Rusnak, Lucas J.: Oriented hypergraphs: introduction and balance (2013)
  7. Walter, Matthias; Truemper, Klaus: Implementation of a unimodularity test (2013)
  8. Crama, Yves (ed.); Hammer, Peter L. (ed.): Boolean functions. Theory, algorithms, and applications (2011)
  9. Bruni, Renato: A logic-based approach to polymer sequence analysis (2010)
  10. Haus, Utz-Uwe; Truemper, Klaus; Weismantel, Robert: Linear satisfiability algorithm for 3CNF formulas of certain signaling networks (2009)
  11. Bruni, Renato: Solving peptide sequencing as satisfiability (2008)
  12. Bruni, Renato; Santori, Andrea: New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (2008)
  13. Conforti, Michele; Cornuéjols, Gérard; Vušković, Kristina: Balanced matrices (2006)
  14. Bruni, Renato: On exact selection of minimally unsatisfiable subformulae (2005)
  15. Pretolani, Daniele: Probability logic and optimization SAT: The PSAT and CPA models (2005)
  16. Bruni, Renato: Solving error correction for large data sets by means of a SAT solver (2004)
  17. Dasgupta, Sudeshna; Chandru, Vijay: Minimal unsatisfiable sets: Classification and bounds (2004)
  18. Truemper, Klaus: Design of logic-based intelligent systems. (2004)
  19. Bruni, Renato: Approximating minimal unsatisfiable subformulae by means of adaptive core search (2003)
  20. Bruni, Renato; Sassano, Antonio: A complete adaptive algorithm for propositional satisfiability (2003)

1 2 next