The following pages link to (Q4255462):
Displaying 39 items.
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- Prominent classes of the most general subsumptive solutions of Boolean equations (Q507645) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- A logic-based approach to polymer sequence analysis (Q655183) (← links)
- Ideal clutters (Q697573) (← links)
- A probabilistic logic based on the acceptability of gambles (Q881801) (← links)
- Solving peptide sequencing as satisfiability (Q929155) (← links)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees (Q1296806) (← links)
- New methods for computing inferences in first order logic (Q1309900) (← links)
- Characterizing consistency in probabilistic logic for a class of Horn clauses (Q1340063) (← links)
- Resolution and the integrality of satisfiability problems (Q1352293) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- A strategic model for supply chain design with logical constraints: Formulation and solution. (Q1422373) (← links)
- Formulating logical implications in combinatorial optimisation (Q1598766) (← links)
- Construction of rule-based assignment models (Q1600909) (← links)
- Autark assignments of Horn CNFs (Q1742887) (← links)
- Generalized probabilistic satisfiability (Q1744442) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs (Q1815824) (← links)
- Optimum inductive methods (Q1892403) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- Probabilistic satisfiability and coherence checking through integer programming (Q2344365) (← links)
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities (Q2424888) (← links)
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872) (← links)
- Constraint-based optimization and utility elicitation using the minimax decision criterion (Q2457617) (← links)
- On a decision procedure for quantified linear programs (Q2462634) (← links)
- Searching for mutually orthogonal Latin squares via integer and constraint programming (Q2496074) (← links)
- New tractable classes for default reasoning from conditional knowledge bases (Q2502153) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae (Q2741521) (← links)
- (Q3018325) (← links)
- Improved extraction method on logic function optimization of mass data processing (Q3399707) (← links)
- From LP to LP: Programming with constraints (Q5096231) (← links)
- Parametric optimization and optimal control using algebraic geometry methods (Q5423850) (← links)
- Calibrated imputation for multivariate categorical data (Q6649310) (← links)
