Sciweavers

7456 search results - page 135 / 1492
» Parallelism in Logic Programming
Sort
View
ENTCS
2008
75views more  ENTCS 2008»
15 years 3 months ago
Focusing the Inverse Method for LF: A Preliminary Report
In this paper, we describe a proof-theoretic foundation for bottom-up logic programming based on uniform proofs in the setting of the logical framework LF. We present a forward un...
Brigitte Pientka, Xi Li, Florent Pompigne
JELIA
2000
Springer
15 years 6 months ago
A Compilation of Brewka and Eiter's Approach to Prioritization
In previous work, we developed a framework for expressing general preference information in default logic and logic programming. Here we show that the approach of Brewka and Eiter ...
James P. Delgrande, Torsten Schaub, Hans Tompits
APAL
2005
135views more  APAL 2005»
15 years 2 months ago
Safe beliefs for propositional theories
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
Mauricio Osorio, Juan Antonio Navarro Pérez...
RTA
2000
Springer
15 years 6 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
ESOP
2012
Springer
13 years 10 months ago
Generate, Test, and Aggregate - A Calculation-based Framework for Systematic Parallel Programming with MapReduce
Abstract. MapReduce, being inspired by the map and reduce primitives available in many functional languages, is the de facto standard for large scale data-intensive parallel progra...
Kento Emoto, Sebastian Fischer, Zhenjiang Hu