Sciweavers

1989 search results - page 161 / 398
» Set functions for functional logic programming
Sort
View
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 6 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
CADE
2008
Springer
15 years 5 months ago
LogAnswer - A Deduction-Based Question Answering System (System Description)
LogAnswer is an open domain question answering system which employs an automated theorem prover to infer correct replies to natural language questions. For this purpose LogAnswer o...
Ulrich Furbach, Ingo Glöckner, Hermann Helbig...
ENGL
2007
144views more  ENGL 2007»
15 years 3 months ago
Constructive Analysis of Intensional Phenomena in Natural Language
Abstract— Chierchia [2, 3, 4], pointed out the inadequacy of Montague’s approach in the analysis of certain natural language constructions, such as nominalization and propositi...
Rogelio Davila, Leonardo Soto, Nahitt H. Padilla
CLOUD
2010
ACM
15 years 8 months ago
Nephele/PACTs: a programming model and execution framework for web-scale analytical processing
We present a parallel data processor centered around a programming model of so called Parallelization Contracts (PACTs) and the scalable parallel execution engine Nephele [18]. Th...
Dominic Battré, Stephan Ewen, Fabian Hueske...
ALT
2001
Springer
16 years 8 days ago
Learning How to Separate
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
Sanjay Jain, Frank Stephan