Sciweavers

300 search results - page 18 / 60
» Subset Types and Partial Functions
Sort
View
TBILLC
2005
Springer
14 years 25 days ago
Natural Logic for Natural Language
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deï...
Jan van Eijck
EDBT
2000
ACM
13 years 11 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
FUIN
2006
85views more  FUIN 2006»
13 years 7 months ago
Implementing Typeful Program Transformations
The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...
Chiyan Chen, Rui Shi, Hongwei Xi
AAAI
2010
13 years 7 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
COMBINATORICS
2004
86views more  COMBINATORICS 2004»
13 years 7 months ago
Multiple Pattern Avoidance with respect to Fixed Points and Excedances
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all th...
Sergi Elizalde