4617 search results - page 366 / 924 » Automation of Diagrammatic Reasoning |
150
click to vote
TARK
1998
Springer
15 years 11 months ago
1998
Springer
We develop a revealed-preferencetheory for multiple agents. Some features of our construction, which draws heavily on Jeffrey's utility theory and on formal constructions by D...
192
click to vote
TPHOL
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper describes the concept of higher order quotients and an implementation in Isabelle. Higher order quotients are a generalization of quotients. They use partial equivalence...
155
click to vote
TPHOL
1997
IEEE
15 years 11 months ago
1997
IEEE
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
182
click to vote
KGC
1997
Springer
15 years 11 months ago
1997
Springer
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
247
click to vote
KGC
1997
Springer
15 years 11 months ago
1997
Springer
The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic t...