Sciweavers

8094 search results - page 182 / 1619
» Improvements in Formula Generalization
Sort
View
IANDC
2007
133views more  IANDC 2007»
15 years 3 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich
JSC
2000
69views more  JSC 2000»
15 years 3 months ago
Generic Polynomials with Few Parameters
We call a polynomial g(t1, . . . , tm, X) over a field K generic for a group G if it has Galois group G as a polynomial in X, and if every Galois field extension N/L with K L and...
Gregor Kemper, Elena Mattig
IANDC
2010
125views more  IANDC 2010»
15 years 2 months ago
Continuation semantics for the Lambek-Grishin calculus
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
Raffaella Bernardi, Michael Moortgat
MA
2010
Springer
143views Communications» more  MA 2010»
15 years 2 months ago
From Archimedean to Liouville copulas
We use a recent characterization of the d-dimensional Archimedean copulas as the survival copulas of d-dimensional simplex distributions (McNeil and Neˇslehov´a (2009)) to const...
Alexander J. McNeil, Johanna Neslehová
146
Voted
PPDP
2010
Springer
15 years 2 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...