Sciweavers

151 search results - page 1 / 31
» Handling Boolean A Boxes
Sort
View
DLOG
2003
13 years 6 months ago
Handling Boolean A Boxes
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear redu...
Carlos Areces, Patrick Blackburn, Bernadette Mart&...
COCO
2006
Springer
75views Algorithms» more  COCO 2006»
13 years 8 months ago
Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries
We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded ...
Albert Atserias
CVPR
2011
IEEE
13 years 28 days ago
A Segmentation-aware Object Detection Model with Occlusion Handling
The bounding box representation employed by many popular object detection models [3, 6] implicitly assumes all pixels inside the box belong to the object. This assumption makes th...
Tianshi Gao, Benjamin Packer, Daphne Koller
ECAI
2006
Springer
13 years 8 months ago
A Solver for QBFs in Nonprenex Form
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
Uwe Egly, Martina Seidl, Stefan Woltran
FSTTCS
2009
Springer
13 years 11 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...