The following pages link to Jordi Levy (Q309918):
Displaying 47 items.
- Generating SAT instances with community structure (Q309919) (← links)
- SAT-based MaxSAT algorithms (Q360042) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Bi-rewrite systems (Q674746) (← links)
- Simplifying the signature in second-order unification (Q843951) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- On the relation between context and sequence unification (Q1034550) (← links)
- On the undecidability of second-order unification (Q1854349) (← links)
- Popularity-similarity random SAT formulas (Q2238712) (← links)
- Anti-unification for unranked terms and hedges (Q2352488) (← links)
- Higher-order pattern anti-unification in linear time (Q2362208) (← links)
- Nominal unification of higher order expressions with recursive let (Q2409747) (← links)
- Resolution procedures for multiple-valued optimization (Q2510176) (← links)
- Equivalence between systems stronger than resolution (Q2661345) (← links)
- (Q2723898) (← links)
- (Q2778877) (← links)
- The Community Structure of SAT Formulas (Q2843344) (← links)
- On the complexity of bounded second-order unification and stratified context unification (Q2889573) (← links)
- A Variant of Higher-Order Anti-Unification (Q2958379) (← links)
- The Fractal Dimension of SAT Formulas (Q3192184) (← links)
- Using Community Structure to Detect Relevant Learnt Clauses (Q3453229) (← links)
- Bounded Second-Order Unification Is NP-Complete (Q3527311) (← links)
- Mapping CSP into Many-Valued SAT (Q3612452) (← links)
- Stratified Context Unification Is NP-Complete (Q3613402) (← links)
- The Complexity of Monadic Second-Order Unification (Q3631904) (← links)
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing (Q3637178) (← links)
- (Q3838759) (← links)
- (Q4314595) (← links)
- (Q4808756) (← links)
- (Q4942094) (← links)
- Term-Graph Anti-Unification (Q4993335) (← links)
- Bi-rewriting, a term rewriting technique for monotonic order relations (Q5055782) (← links)
- Linear second-order unification (Q5055871) (← links)
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let (Q5075515) (← links)
- Community Structure in Industrial SAT Instances (Q5235475) (← links)
- Nominal Anti-Unification (Q5277871) (← links)
- Anti-Unification for Unranked Terms and Hedges (Q5389083) (← links)
- An Efficient Nominal Unification Algorithm (Q5389146) (← links)
- Automated Deduction – CADE-20 (Q5394611) (← links)
- Sequence Unification Through Currying (Q5432347) (← links)
- A Complete Calculus for Max-SAT (Q5756577) (← links)
- Nominal Unification from a Higher-Order Perspective (Q5892169) (← links)
- Rewriting Techniques and Applications (Q5901562) (← links)
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)
- Scale-Free Random SAT Instances (Q6290396) (← links)
- Polynomial calculus for MaxSAT (Q6643077) (← links)
- Polynomial calculus for optimization (Q6665696) (← links)
