Pages that link to "Item:Q1356218"
From MaRDI portal
The following pages link to Solving propositional satisfiability problems (Q1356218):
Displayed 35 items.
- A weight-balanced branching rule for SAT (Q597527) (← links)
- Computing minimal models by partial instantiation (Q672131) (← links)
- A dual algorithm for the satisfiability problem (Q750165) (← links)
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093) (← links)
- Linear programs for constraint satisfaction problems (Q1278588) (← links)
- How good are branching rules in DPLL? (Q1281405) (← links)
- New methods for computing inferences in first order logic (Q1309900) (← links)
- An exact algorithm for the constraint satisfaction problem: Application to logical inference (Q1313760) (← links)
- Logic cuts for processing networks with fixed charges (Q1317071) (← links)
- Inference flexibility in Horn clause knowledge bases and the simplex method (Q1319393) (← links)
- Computing definite logic programs by partial instantiation (Q1326778) (← links)
- Easy problems are sometimes hard (Q1342226) (← links)
- Embedding complex decision procedures inside an interactive theorem prover. (Q1353946) (← links)
- Branch-and-cut solution of inference problems in propositional logic (Q1356213) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- On the limit of branching rules for hard random unsatisfiable 3-SAT (Q1408384) (← links)
- Backtracking tactics in the backtrack method for SAT (Q1596804) (← links)
- A cost-reducing question-selection algorithm for propositional knowledge-based systems (Q1776198) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- Solving satisfiability problems using elliptic approximations -- effective branching rules (Q1841892) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
- Running time experiments on some algorithms for solving propositional satisfiability problems (Q1897402) (← links)
- Branching rules for satisfiability (Q1904401) (← links)
- Many-valued logic and mixed integer programming (Q1924752) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- On the complexity of choosing the branching literal in DPLL (Q1978252) (← links)
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks (Q2368099) (← links)
- Solving SAT problem by heuristic polarity decision-making algorithm (Q2465749) (← links)
- New tractable classes for default reasoning from conditional knowledge bases (Q2502153) (← links)
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT (Q3631249) (← links)
- Exploiting data dependencies in many-valued logics (Q4868234) (← links)
