Sciweavers

1385 search results - page 57 / 277
» Natural Rewriting for General Term Rewriting Systems
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
15 years 6 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
SIGIR
2010
ACM
15 years 6 months ago
Generalized syntactic and semantic models of query reformulation
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
IAJIT
2010
166views more  IAJIT 2010»
15 years 4 months ago
Specification and Prototyping of Reactive Distributed Systems with Algebraic Term Nets
: The specification of the dynamic behaviour of reactive distributed systems must exhibit the structures of control and has to imply explicitly the relevant aspects of the distribu...
Faiza Bouchoul, Mohamed Mostefai
SIGIR
2005
ACM
15 years 11 months ago
Web-based acquisition of Japanese katakana variants
This paper describes a method of detecting Japanese Katakana variants from a large corpus. Katakana words, which are mainly used as loanwords, cause problems with information retr...
Takeshi Masuyama, Hiroshi Nakagawa
IFIP
2004
Springer
15 years 11 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi