14084 search results - page 2649 / 2817 » A Theory for Game Theories |
165
click to vote
CTCS
1989
Springer
15 years 10 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
156
click to vote
CTRS
1990
15 years 10 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
176
click to vote
ERSHOV
1989
Springer
15 years 10 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
186
click to vote
FPCA
1989
15 years 10 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
173
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally c...