Sciweavers

884 search results - page 104 / 177
» A Proof Theory for DL-Lite
Sort
View
ICCV
2007
IEEE
15 years 6 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
MKM
2007
Springer
15 years 6 months ago
Narrative Structure of Mathematical Texts
Abstract. There are many styles for the narrative structure of a mathematical document. Each mathematician has its own conventions and traditions about labeling portions of texts (...
Fairouz Kamareddine, Manuel Maarek, Krzysztof Rete...
ACL2
2006
ACM
15 years 5 months ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber
COMPGEOM
2004
ACM
15 years 5 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
IFM
2004
Springer
15 years 5 months ago
Verifying Controlled Components
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
Steve Schneider, Helen Treharne