Sciweavers

634 search results - page 23 / 127
» Completion Procedures as Semidecision Procedures
Sort
View
RTA
1993
Springer
14 years 1 months ago
Redundancy Criteria for Constrained Completion
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...
Christopher Lynch, Wayne Snyder
TIC
2000
Springer
124views System Software» more  TIC 2000»
14 years 1 months ago
Sound and Complete Elimination of Singleton Kinds
Singleton kinds provide an elegant device for expressing type equality information resulting from modern module languages, but they can severely complicate the metatheory of langu...
Karl Crary
DAS
2008
Springer
13 years 11 months ago
A Complete Optical Character Recognition Methodology for Historical Documents
In this paper a complete OCR methodology for recognizing historical documents, either printed or handwritten without any knowledge of the font, is presented. This methodology cons...
Georgios Vamvakas, Basilios Gatos, Nikolaos Stamat...
IJFCS
2006
111views more  IJFCS 2006»
13 years 9 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis
JAR
2006
101views more  JAR 2006»
13 years 9 months ago
Checking Consistency and Completeness of On-Line Product Manuals
Abstract. As products are growing more complex, so is their documentation. With an increasing number of product options, the diversity in service and maintenance procedures grows a...
Carsten Sinz, Wolfgang Küchlin, Dieter Feicht...