26 search results - page 4 / 6 » Closed and Logical Relations for Over- and Under-Approximati... |
POPL
2006
ACM
14 years 7 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
IJCAI
2003
13 years 8 months ago
2003
In this paper, we define a simple but scalable framework for peer-to-peer data sharing systems, in which the problem of answering queries over a network of semantically related p...
RML
2002
13 years 7 months ago
2002
Conceptual modeling techniques such as EER, ORM and to some extent the UML have been developed in the past for building information systems. These techniques or suitable extensions...
ENTCS
2002
13 years 7 months ago
2002
In the quest for an elegant formulation of the notion of "polycategory" we develop a more symmetric counterpart to Burroni's notion of "T-category", where ...
JAIR
2008
13 years 7 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...