2529 search results - page 70 / 506 » The Logical Structure of Binding |
TARK
2009
Springer
15 years 4 months ago
2009
Springer
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
170
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
62
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
BMCBI
2005
14 years 9 months ago
2005
Background: The Flaviviridae virus family includes major human and animal pathogens. The RNA dependent RNA polymerase (RdRp) plays a central role in the replication process, and t...
ISMVL
2000
IEEE
15 years 2 months ago
2000
IEEE
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...