Sciweavers

306 search results - page 47 / 62
» Underspecified computation of normal forms
Sort
View
IJAR
2010
91views more  IJAR 2010»
13 years 6 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
WOLLIC
2010
Springer
13 years 5 months ago
Intersection Type Systems and Explicit Substitutions Calculi
Abstract. The λ-calculus with de Bruijn indices, called λdB, assembles each α-class of λ-terms into a unique term, using indices instead of variable names. Intersection types p...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...
WINE
2010
Springer
154views Economy» more  WINE 2010»
13 years 5 months ago
The Good, The Bad and The Cautious: Safety Level Cooperative Games
Abstract. We study safety level coalitions in competitive games. Given a normal form game, we define a corresponding cooperative game with transferable utility, where the value of ...
Yoram Bachrach, Maria Polukarov, Nicholas R. Jenni...
ACL
2009
13 years 5 months ago
Better Word Alignments with Supervised ITG Models
This work investigates supervised word alignment methods that exploit inversion transduction grammar (ITG) constraints. We consider maximum margin and conditional likelihood objec...
Aria Haghighi, John Blitzer, John DeNero, Dan Klei...
ICFP
1999
ACM
13 years 12 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...