Sciweavers

250 search results - page 5 / 50
» Fixed Argument Pairings
Sort
View
JCT
2008
84views more  JCT 2008»
13 years 9 months ago
Fix-Mahonian Calculus, II: Further statistics
Using classical transformations on the symmetric group and two transformations constructed in Fix-Mahonian Calculus I, we show that several multivariable statistics are equidistrib...
Dominique Foata, Guo-Niu Han
DLT
2008
13 years 11 months ago
Fixed Point and Aperiodic Tilings
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics rangin...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
COLING
2008
13 years 11 months ago
Two-Phased Event Relation Acquisition: Coupling the Relation-Oriented and Argument-Oriented Approaches
Addressing the task of acquiring semantic relations between events from a large corpus, we first argue the complementarity between the pattern-based relation-oriented approach and...
Shuya Abe, Kentaro Inui, Yuji Matsumoto
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 9 months ago
SAT Solving for Argument Filterings
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoo...
CADE
2009
Springer
14 years 10 months ago
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
Carsten Fuhs, Jürgen Giesl, Michael Parting, ...