The following pages link to Enric Rodríguez-Carbonell (Q438575):
Displaying 33 items.
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- (Q859955) (redirect page) (← links)
- Automatic generation of polynomial invariants of bounded degree using abstract interpretation (Q859956) (← links)
- Hard problems in max-algebra, control theory, hypergraphs and other areas (Q990130) (← links)
- Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra (Q1003740) (← links)
- A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
- Generating all polynomial invariants in simple loops (Q2457430) (← links)
- Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
- SMT-Based Array Invariant Generation (Q2926644) (← links)
- BDDs for Pseudo-Boolean Constraints – Revisited (Q3007674) (← links)
- Semiring-Induced Propositional Logic: Definition and Basic Algorithms (Q3066107) (← links)
- A New Look at BDDs for Pseudo-Boolean Constraints (Q3143578) (← links)
- Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions (Q3192080) (← links)
- Proving Termination Through Conditional Termination (Q3303892) (← links)
- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers (Q3502696) (← links)
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers (Q3568227) (← links)
- Cardinality Networks and Their Applications (Q3637166) (← links)
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (Q3637179) (← links)
- Automatic Generation of Polynomial Loop Invariants (Q4657335) (← links)
- The recursive path and polynomial ordering for first-order and higher-order terms (Q4914419) (← links)
- Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers (Q4972164) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
- A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints (Q5415453) (← links)
- Challenges in Satisfiability Modulo Theories (Q5432330) (← links)
- Static Analysis (Q5466567) (← links)
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT (Q5505540) (← links)
- The Max-Atom Problem and Its Relevance (Q5505542) (← links)
- Hybrid Systems: Computation and Control (Q5703954) (← links)
- Theoretical Aspects of Computing - ICTAC 2004 (Q5709984) (← links)
- Applications and Theory of Petri Nets 2005 (Q5713501) (← links)
- Static Analysis (Q5897426) (← links)
- IntSat: integer linear programming by conflict-driven constraint learning (Q6585824) (← links)
