Sciweavers

1302 search results - page 46 / 261
» Free-Style Theorem Proving
Sort
View
IPL
2000
94views more  IPL 2000»
13 years 7 months ago
On rewrite constraints and context unification
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
Joachim Niehren, Sophie Tison, Ralf Treinen
IJAR
2002
109views more  IJAR 2002»
13 years 7 months ago
The application of the matrix calculus to belief functions
The mathematics of belief functions can be handled with the use of the matrix notation. This representation helps greatly the user thanks to its notational simplicity and its effi...
Philippe Smets
JACM
2002
142views more  JACM 2002»
13 years 7 months ago
Timed regular expressions
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
Eugene Asarin, Paul Caspi, Oded Maler
JCT
1998
193views more  JCT 1998»
13 years 7 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
MOC
2002
80views more  MOC 2002»
13 years 7 months ago
Component-by-component construction of good lattice rules
This paper provides a novel approach to the construction of good lattice rules for the integration of Korobov classes of periodic functions over the unit s-dimensional cube. Theore...
Ian H. Sloan, Andrew V. Reztsov