4166 search results - page 645 / 834 » Automating the constraining process |
151
Voted
LLL
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
140
Voted
TIME
1994
IEEE
15 years 7 months ago
1994
IEEE
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
120
Voted
ICLP
1992
Springer
15 years 7 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
116
Voted
FC
2010
Springer
15 years 7 months ago
2010
Springer
Key management is the Achilles’ heel of cryptography. This work presents a novel Key-Lifecycle Management System (KLMS), which addresses two issues that have not been addressed ...
148
Voted
LICS
1991
IEEE
15 years 7 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...