Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
Abstract. In this paper, we show how to efficiently and effectively extract a rich class of low-rank textures in a 3D scene from 2D images despite significant distortion and warpin...
Abstract--Knowledge is attributed to human whose problemsolving behavior is subjective and complex. In today's knowledge economy, the need to manage knowledge produced by a co...
Abstract--Collaborating agents require either prior agreement on the shared vocabularies that they use for communication, or some means of translating between their private ontolog...
Heather S. Packer, Nicholas Gibbins, Nicholas R. J...