Sciweavers

500 search results - page 64 / 100
» ACD Term Rewriting
Sort
View
SIGIR
2010
ACM
14 years 10 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...
ENTCS
2006
113views more  ENTCS 2006»
14 years 9 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
70
Voted
CADE
2009
Springer
15 years 10 months ago
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
Carsten Fuhs, Jürgen Giesl, Michael Parting, ...
CISIS
2010
IEEE
15 years 4 months ago
Gene Ontology Rewritten for Computing Gene Functional Similarity
Abstract—Discovery biological organisation of the cell in modules network is a challenging task. Currently, approaches based on a controlled vocabulary, as Gene Ontology, to iden...
Alessia Visconti, Francesca Cordero, Marco Botta, ...
68
Voted
BIRTHDAY
2009
Springer
15 years 4 months ago
Mobile Processes and Termination
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...