4940 search results - page 220 / 988 » On the Complexity of Universal Programs |
168
click to vote
AGP
2003
IEEE
15 years 11 months ago
2003
IEEE
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
178
click to vote
PPDP
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe...
184
click to vote
FM
2006
Springer
15 years 10 months ago
2006
Springer
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
181
click to vote
JCC
2008
15 years 5 months ago
2008
: The prediction of the binding free energy between a ligand and a protein is an important component in the virtual screening and lead optimization of ligands for drug discovery. T...
185
click to vote
CP
2005
Springer
16 years 11 hour ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...