Sciweavers

6829 search results - page 356 / 1366
» Quantitative Generalizations of Languages
Sort
View
WWW
2010
ACM
15 years 11 months ago
An information retrieval approach to spelling suggestion
In this paper, we present a two-step language-independent spelling suggestion system. In the first step, candidate suggestions are generated using an Information Retrieval(IR) ap...
Sai Krishna, Prasad Pingali, Vasudeva Varma
TPHOL
1999
IEEE
15 years 11 months ago
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
ICLP
1998
Springer
15 years 11 months ago
A Choice-Point Library for Backtrack Programming
Implementing a compiler for a language with nondeterministic features is known to be a difficult task. This paper presents two new functions setChoicePoint and fail that extend th...
Pierre-Etienne Moreau
WADT
1998
Springer
15 years 11 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
ICLP
1994
Springer
15 years 11 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...