Sciweavers

1664 search results - page 279 / 333
» Towards Partial Reasoning
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
14 years 12 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
INFFUS
2006
103views more  INFFUS 2006»
14 years 12 months ago
Information fusion approaches to the automatic pronunciation of print by analogy
Automatic pronunciation of words from their spelling alone is a hard computational problem, especially for languages like English and French where there is only a partially consis...
Robert I. Damper, Yannick Marchand
JUCS
2008
166views more  JUCS 2008»
14 years 11 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
JUCS
2006
131views more  JUCS 2006»
14 years 11 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
TITS
2008
158views more  TITS 2008»
14 years 11 months ago
Real-Time Incremental Segmentation and Tracking of Vehicles at Low Camera Angles Using Stable Features
We present a method for segmenting and tracking vehicles on highways using a camera that is relatively low to the ground. At such low angles, 3-D perspective effects cause signific...
Neeraj K. Kanhere, Stanley T. Birchfield