Sciweavers

4513 search results - page 333 / 903
» Logic programming with satisfiability
Sort
View
ECCV
2000
Springer
16 years 6 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
145
Voted
CSB
2005
IEEE
129views Bioinformatics» more  CSB 2005»
15 years 10 months ago
A Pivoting Algorithm for Metabolic Networks in the Presence of Thermodynamic Constraints
A linear programming algorithm is presented to constructively compute thermodynamically feasible fluxes and change in chemical potentials of reactions for a metabolic network. It...
R. Nigam, S. Liang
173
Voted
FP
1991
95views Formal Methods» more  FP 1991»
15 years 8 months ago
Making Functionality More General
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
Graham Hutton, Ed Voermans
LOPSTR
2007
Springer
15 years 10 months ago
Denotation by Transformation
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
Bernd Braßel, Jan Christiansen
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 4 months ago
Guarded Hybrid Knowledge Bases
Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web. We define guarded hybrid knowledge bases (or g-hybrid knowledge...
Stijn Heymans, Jos de Bruijn, Livia Predoiu, Crist...