Sciweavers

1549 search results - page 202 / 310
» On the rules of intermediate logics
Sort
View
KBSE
1997
IEEE
14 years 1 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002
EUROPAR
2007
Springer
14 years 1 months ago
Domain-Specific Optimization Strategy for Skeleton Programs
Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
SPIRE
2000
Springer
14 years 20 days ago
A Word Stemming Algorithm for the Spanish Language
This paper describes a word stemming algorithm for the Spanish Language. Experiments in document retrieval regarding English text suggest that word stemming based on morphological...
Asunción Honrado, Ruben Leon, Ruairi O'Donn...
ALIFE
2008
13 years 9 months ago
The Nature of Words in Human Protolanguages: It's Not a Holophrastic-Atomic Meanings Dichotomy
There is an ongoing debate as to whether the words in early pre-syntactic forms of human language had simple atomic meanings like modern words [4, 5], or whether they were holophr...
Mike Dowman
ENTCS
2008
110views more  ENTCS 2008»
13 years 9 months ago
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
Javier Álvez, Paqui Lucio