1693 search results - page 272 / 339 » Pattern-Recognition: a Foundational Approach |
128
click to vote
KR
1998
Springer
15 years 8 months ago
1998
Springer
This work is motivated by the existence of two useful but quite different knowledge representation formalisms, the situation calculus due to McCarthy, and the logic OL of only kno...
146
click to vote
POPL
1996
ACM
15 years 8 months ago
1996
ACM
Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular program...
162
click to vote
TYPES
1994
Springer
15 years 8 months ago
1994
Springer
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
114
click to vote
ICLP
1990
Springer
15 years 8 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
180
click to vote
CIBCB
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract-- The advance of high-throughput experimental technologies poses continuous challenges to computational data analysis in functional and comparative genomics studies. Gene ...