scientific article; zbMATH DE number 1380573
From MaRDI portal
Publication:4705311
zbMath0935.68048MaRDI QIDQ4705311
Publication date: 19 December 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (21)
Oriented hypergraphs: balanceability ⋮ Unnamed Item ⋮ Oriented hypergraphs: introduction and balance ⋮ Approximating minimal unsatisfiable subformulae by means of adaptive core search ⋮ A satisfiability procedure for quantified Boolean formulae ⋮ Balanced matrices ⋮ 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) ⋮ A logic-based approach to polymer sequence analysis ⋮ Solving peptide sequencing as satisfiability ⋮ New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability ⋮ Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches ⋮ On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic ⋮ Ideal clutters ⋮ On exact selection of minimally unsatisfiable subformulae ⋮ Probability logic and optimization SAT: The PSAT and CPA models ⋮ A characterization of oriented hypergraphic balance via signed weak walks ⋮ A complete adaptive algorithm for propositional satisfiability ⋮ Leibniz ⋮ The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas ⋮ A perspective on certain polynomial-time solvable classes of satisfiability ⋮ On functional dependencies in \(q\)-Horn theories
Uses Software
This page was built for publication:
