56 results on '"Levy, Jordi"'
Search Results
2. Yet Another (Fake) Proof of P=NP
3. The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
4. Equivalence Between Systems Stronger Than Resolution
5. The impact of heterogeneity and geometry on the proof complexity of random satisfiability
6. Is Shortest Always Best? The Role of Brevity in Logic-to-Text Generation
7. Nominal Unification of Higher Order Expressions with Recursive Let
8. Scale-Free Random SAT Instances
9. Nominal Unification and Matching of Higher Order Expressions with Recursive Let
10. Multi-objective vehicle routing with automated negotiation
11. Using Community Structure to Detect Relevant Learnt Clauses
12. Popularity-similarity random SAT formulas
13. Reducing SAT to Max2SAT
14. The Fractal Dimension of SAT Formulas
15. Improving WPM2 for (Weighted) Partial MaxSAT
16. Improving SAT-Based Weighted MaxSAT Solvers
17. The Community Structure of SAT Formulas
18. On the Structure of Industrial SAT Instances
19. Solving (Weighted) Partial MaxSAT through Satisfiability Testing
20. Nominal Unification from a Higher-Order Perspective
21. The Self-Similarity of Industrial SAT Instances
22. A Complete Calculus for Max-SAT
23. Bounded Second-Order Unification Is NP-Complete
24. Stratified Context Unification Is NP-Complete
25. Well-Nested Context Unification
26. Monadic Second-Order Unification Is NP-Complete
27. Currying Second-Order Unification Problems
28. Context Unification and Traversal Equations
29. Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
30. Implementing inequality and nondeterministic specifications with bi-rewriting systems
31. Community Structure in Industrial SAT Instances
32. Expressing program requirements using refinement lattices
33. Bi-rewriting, a term rewriting technique for monotonic order relations
34. Bi-rewriting, a term rewriting technique for monotonic order relations
35. Structure features for SAT instances classification
36. Locality in Random SAT Instances
37. Generating SAT instances with community structure
38. Higher-Order Pattern Anti-Unification in Linear Time
39. Exploiting subproblem optimization in SAT-based MaxSAT algorithms
40. Mapping CSP into Many-Valued SAT
41. Sequence Unification Through Currying
42. Anti-unification for Unranked Terms and Hedges
43. Resolution procedures for multiple-valued optimization
44. SAT-based MaxSAT algorithms
45. Nominal Unification from a Higher-Order Perspective
46. A New Algorithm for Weighted Partial MaxSAT
47. On the relation between Context and Sequence Unification
48. Simplifying the signature in second-order unification
49. The Complexity of Monadic Second-Order Unification
50. Resolution for Max-SAT
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.