1664 search results - page 268 / 333 » Towards Partial Reasoning |
165
click to vote
HASKELL
2005
ACM
15 years 10 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
120
click to vote
MMSEC
2005
ACM
15 years 10 months ago
2005
ACM
In this work we propose a new algorithm for fragile, high capacity yet file-size preserving watermarking of MPEG-2 streams. Watermarking is done entirely in the compressed domain,...
159
click to vote
ASP
2005
Springer
15 years 10 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
154
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
117
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens ...