Sciweavers

733 search results - page 113 / 147
» A Logic Programming View of Authorization in Distributed Sys...
Sort
View
GRID
2006
Springer
15 years 1 months ago
Grid Deployment of Legacy Bioinformatics Applications with Transparent Data Access
Although grid computing offers great potential for executing large-scale bioinformatics applications, practical deployment is constrained by legacy interfaces. Most widely deployed...
Christophe Blanchet, Rémi Mollon, Douglas T...
POPL
2005
ACM
16 years 2 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
ICML
2004
IEEE
16 years 2 months ago
Learning first-order rules from data with multiple parts: applications on mining chemical compound data
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
Cholwich Nattee, Sukree Sinthupinyo, Masayuki Numa...
GPCE
2009
Springer
15 years 5 months ago
Mapping problem-space to solution-space features: a feature interaction approach
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
Frans Sanen, Eddy Truyen, Wouter Joosen
SAT
2007
Springer
118views Hardware» more  SAT 2007»
15 years 8 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov