Pages that link to "Item:Q1100931"

The following pages link to Some results and experiments in programming techniques for propositional logic (Q1100931):

Displaying 22 items.

• A linear-time transformation of linear inequalities into conjunctive normal form (Q293409) (← links)
• On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
• Projecting systems of linear inequalities with binary variables (Q646699) (← links)
• A dual algorithm for the satisfiability problem (Q750165) (← links)
• Algorithms for the maximum satisfiability problem (Q753502) (← links)
• Computational experience with an interior point algorithm on the satisfiability problem (Q753688) (← links)
• Compact normal forms in propositional logic and integer programming formulations (Q910335) (← links)
• Modeling and integer programming techniques applied to propositional calculus (Q918954) (← links)
• Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
• Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093) (← links)
• Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
• Sensitivity analysis for Horn formulae (Q1200328) (← links)
• An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
• Deriving conclusions in expert systems when knowledge is incomplete (Q1201854) (← 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)
• Generating logical expressions from positive and negative examples via a branch-and-bound approach (Q1318514) (← links)
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807) (← links)
• On renamable Horn and generalized Horn functions (Q1356207) (← links)
• Branch-and-cut solution of inference problems in propositional logic (Q1356213) (← links)
• Solving propositional satisfiability problems (Q1356218) (← links)
• A BDD SAT solver for satisfiability testing: An industrial case study (Q1380431) (← links)