10568 search results - page 757 / 2114 » Computer Intelligence and Formalization |
216
Voted
STACS
1991
Springer
15 years 11 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
161
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
Over the past two decades, Gurevich and his colleagues have developed axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized t...
201
Voted
JUCS
2006
15 years 7 months ago
2006
Abstract: In this paper the analysis of the data structures used in a symbolic computation system, called Kenzo, is undertaken. We deal with the specification of the inheritance re...
194
click to vote
NAACL
2010
15 years 5 months ago
2010
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
188
Voted
ATAL
2005
Springer
16 years 29 days ago
2005
Springer
This publication summarizes research on the the design and implementation of liberalized version of existing truth-finding protocols for argumentation, such as the standard two-a...