Sciweavers

84 search results - page 11 / 17
» Theme-Based Literate Programming
Sort
View
ICALP
2001
Springer
13 years 11 months ago
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...
Albert Atserias, Maria Luisa Bonet, Juan Luis Este...
ICML
2009
IEEE
14 years 7 months ago
Block-wise construction of acyclic relational features with monotone irreducibility and relevancy properties
We describe an algorithm for constructing a set of acyclic conjunctive relational features by combining smaller conjunctive blocks. Unlike traditional level-wise approaches which ...
Filip Zelezný, Ondrej Kuzelka
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
13 years 11 months ago
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
BILDMED
2008
129views Algorithms» more  BILDMED 2008»
13 years 8 months ago
Evaluating the Performance of Processing Medical Volume Data on Graphics Hardware
With the broad availability and increasing performance of commodity graphics processors (GPU), non-graphical applications have become an active field of research. However, leveragi...
Matthias Raspe, Guido Lorenz, Stefan Müller 0...
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 6 months ago
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
Paul Tarau