Sciweavers

5499 search results - page 185 / 1100
» Generalized Rewrite Theories
Sort
View
ICFP
2005
ACM
16 years 7 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
16 years 1 months ago
Networks preserving evolutionary equilibria and the power of randomization
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...
Michael S. Kearns, Siddharth Suri
UAI
1998
15 years 8 months ago
Axiomatizing Causal Reasoning
Causal models defined in terms of a collection of equations, as defined by Pearl, are axiomatized here. Axiomatizations are provided for three successively more general classes of...
Joseph Y. Halpern
COSIT
2009
Springer
165views GIS» more  COSIT 2009»
16 years 1 months ago
To Be and Not To Be: 3-Valued Relations on Graphs
Spatial information requires models which allow us to answer ‘maybe’ to questions asking whether a location lies within a region. At the same time, models must account for data...
John G. Stell
CADE
2003
Springer
16 years 7 months ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes