834 search results - page 12 / 167 » Computing Minimal Models, Stable Models, and Answer Sets |
MICCAI
2005
Springer
16 years 17 days ago
2005
Springer
In this study we address the problem of extracting a robust connectivity metric for brain white matter. We defined the connectivity problem as an energy minimization task, by assoc...
87
Voted
NMR
2004
Springer
15 years 5 months ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Nonlinear registration is mostly performed after initialization by a global, linear transformation (in this work, we focus on similarity transformations), computed by a linear reg...
ASP
2003
Springer
15 years 5 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
104
click to vote
BIOINFORMATICS
2008
14 years 11 months ago
2008
Motivation: For many biotechnological purposes, it is desirable to redesign proteins to be more structurally and functionally stable at higher temperatures. For example, chemical ...