scientific article; zbMATH DE number 1324220

zbMath0997.90506MaRDI QIDQ4255462

No author found.

Publication date: 15 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (36)

Characterizing consistency in probabilistic logic for a class of Horn clauses ⋮ What we can learn from conflicts in propositional satisfiability ⋮ Resolution and the integrality of satisfiability problems ⋮ An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs ⋮ Unnamed Item ⋮ A probabilistic logic based on the acceptability of gambles ⋮ From LP to LP: Programming with constraints ⋮ Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities ⋮ A faster algorithm for determining the linear feasibility of systems of BTVPI constraints ⋮ Learning from conflicts in propositional satisfiability ⋮ Approximating minimal unsatisfiable subformulae by means of adaptive core search ⋮ A strategic model for supply chain design with logical constraints: Formulation and solution. ⋮ Semidefinite resolution and exactness of semidefinite relaxations for satisfiability ⋮ A logic-based approach to polymer sequence analysis ⋮ Solving peptide sequencing as satisfiability ⋮ Constraint-based optimization and utility elicitation using the minimax decision criterion ⋮ New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability ⋮ On a decision procedure for quantified linear programs ⋮ Autark assignments of Horn CNFs ⋮ Generalized probabilistic satisfiability ⋮ Prominent classes of the most general subsumptive solutions of Boolean equations ⋮ On semidefinite least squares and minimal unsatisfiability ⋮ Ideal clutters ⋮ Parametric optimization and optimal control using algebraic geometry methods ⋮ Searching for mutually orthogonal Latin squares via integer and constraint programming ⋮ On exact selection of minimally unsatisfiable subformulae ⋮ New tractable classes for default reasoning from conditional knowledge bases ⋮ A complete adaptive algorithm for propositional satisfiability ⋮ Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs ⋮ Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas ⋮ On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls ⋮ On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees ⋮ New methods for computing inferences in first order logic ⋮ Probabilistic satisfiability and coherence checking through integer programming ⋮ Formulating logical implications in combinatorial optimisation ⋮ Construction of rule-based assignment models

This page was built for publication: