The following pages link to (Q5593816):
Displayed 50 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- A pearl on SAT and SMT solving in Prolog (Q428887) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- Extended clause learning (Q622116) (← links)
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- Extension without cut (Q714731) (← links)
- Average time analyses of simplified Davis-Putnam procedures (Q787685) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
- Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093) (← links)
- A satisfiability tester for non-clausal propositional calculus (Q1111774) (← links)
- Optimizing propositional calculus formulas with regard to questions of deducibility (Q1117918) (← links)
- Turning cycles into spirals (Q1295442) (← links)
- On average time hierarchies (Q1313704) (← links)
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Equivalent literal propagation in the DLL procedure (Q1408382) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms (Q1678752) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Generalized probabilistic satisfiability (Q1744442) (← links)
- Intra- and interdiagram consistency checking of behavioral multiview models (Q1749133) (← links)
- Streams and strings in formal proofs. (Q1853510) (← links)
- Space bounds for resolution (Q1854472) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- Short resolution proofs for a sequence of tricky formulas (Q1924995) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- On a generalization of extended resolution (Q1961452) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- Bigraphs with sharing (Q2339468) (← links)
- On an MCS-based inconsistency measure (Q2374545) (← links)
- Local and global symmetry breaking in itemset mining (Q2398272) (← links)
- Formal methods for reasoning and uncertainty reduction in evidential grid maps (Q2407931) (← links)
- Abstract interpretation of microcontroller code: intervals meet congruences (Q2442953) (← links)
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- Bounded Model Checking with Parametric Data Structures (Q2864380) (← links)
- Interpolant Learning and Reuse in SAT-Based Model Checking (Q2864382) (← links)
- Compressing BMC Encodings with QBF (Q2864383) (← links)
- Cycling in proofs and feasibility (Q4942870) (← links)
- Using Abduction to Compute Efficient Proofs (Q5178959) (← links)
- Study of discrete automaton models of gene networks of nonregular structure using symbolic calculations (Q5264738) (← links)
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity (Q5941296) (← links)
- Asymptotic cyclic expansion and bridge groups of formal proofs (Q5945614) (← links)