Sciweavers

JAR
2011
112views more  JAR 2011»
12 years 10 months ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
JAR
2011
49views more  JAR 2011»
12 years 10 months ago
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems
Véronique Cortier, Steve Kremer, Bogdan War...
JAR
2011
63views more  JAR 2011»
12 years 10 months ago
ABox Abduction in the Description Logic ALC
Szymon Klarman, Ulle Endriss, Stefan Schlobach
JAR
2011
60views more  JAR 2011»
12 years 10 months ago
Resolution with Order and Selection for Hybrid Logics
Carlos Areces, Daniel Gorín