300 search results - page 16 / 60 » An extension of the Cayley-Sylvester formula |
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each othe...
TIT
2010
13 years 2 months ago
2010
We determine that exponential Welch permutations lead in general to the smallest maximal frequency hops among all Costas permutations, and are also relatively easy to study, as a ...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
ICLP
1998
Springer
14 years 3 days ago
1998
Springer
There have been several proposals for logic programming language based on linear logic: Lolli [6], Lygon [5], LO [3], LinLog [2], Forum [8]. In addition, BinProlog allows the use ...
JANCL
2008
13 years 7 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...