Sciweavers

261 search results - page 36 / 53
» Proof Normalization Modulo
Sort
View
ACL2
2006
ACM
14 years 1 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
ICTCS
2003
Springer
14 years 19 days ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
PICS
2001
13 years 8 months ago
Measuring Visual Threshold of Inkjet Banding
Banding can be a major defect in inkjet printing. Knowing the visual sensitivity threshold of inkjet banding is therefore useful for understanding and pushing the technological li...
Chengwu Cui, Dingcai Cao, Shaun T. Love
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 7 months ago
Context-Sensitive Languages, Rational Graphs and Determinism
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
Arnaud Carayol, Antoine Meyer
IJRR
2007
335views more  IJRR 2007»
13 years 7 months ago
Homography-based 2D Visual Tracking and Servoing
The objective of this paper is to propose a new homography-based approach to image-based visual tracking and servoing. The visual tracking algorithm proposed in the paper is based...
Selim Benhimane, Ezio Malis