Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
Background: Quantification of the metabolic network of an organism offers insights into possible ways of developing mutant strain for better productivity of an extracellular metab...
This paper advocates an implicit-surface representation of generic 3?D surfaces to take advantage of occluding edges in a very robust way. This lets us exploit silhouette constrai...