Leibniz
From MaRDI portal
Cited in
(39)- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- A satisfiability procedure for quantified Boolean formulae
- Some interesting research directions in satisfiability
- On functional dependencies in q-Horn theories
- Algebraic and dynamical cancellations associated to spectral sequence
- On exact selection of minimally unsatisfiable subformulae
- Probability logic and optimization SAT: The PSAT and CPA models
- A complete adaptive algorithm for propositional satisfiability
- A perspective on certain polynomial-time solvable classes of satisfiability
- Unimodularity
- Implementation of a unimodularity test
- 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)
- An algorithm for the class of pure implicational formulas
- Oriented hypergraphs: balanceability
- HeerHugo
- MACEK
- Signed-graphic matroids with all-graphic cocircuits
- Balanced matrices
- Unimodularity Test
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
- Consistency of the static and dynamic components of object-oriented specifications
- A MINSAT approach for learning in logic domains
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 5613969 (Why is no real title available?)
- Oriented hypergraphs: introduction and balance
- scientific article; zbMATH DE number 1113994 (Why is no real title available?)
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- On the number of circuits in regular matroids (with connections to lattices and codes)
- Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches
- Theory and Applications of Satisfiability Testing
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- graphB
- A logic-based approach to polymer sequence analysis
- Ideal clutters
- A characterization of oriented hypergraphic balance via signed weak walks
- Solving peptide sequencing as satisfiability
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
This page was built for software: Leibniz
