Sciweavers

634 search results - page 25 / 127
» Completion Procedures as Semidecision Procedures
Sort
View
CADE
2008
Springer
14 years 10 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
ICDAR
2005
IEEE
14 years 3 months ago
Motion Deblurring for Optical Character Recognition
This paper investigates the problem of blurring caused by motion during image capture of text documents. Motion blurring prevents proper optical character recognition of the docum...
Xing Yu Qi, Li Zhang, Chew Lim Tan
LICS
2003
IEEE
14 years 3 months ago
New Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
Harald Ganzinger, Konstantin Korovin
IFIP
1992
Springer
14 years 1 months ago
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
Jochen Beister, Ralf Wollowski
AAAI
2008
14 years 2 days ago
Credulous Resolution for Answer Set Programming
The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same s...
Piero A. Bonatti, Enrico Pontelli, Tran Cao Son