Sciweavers

50 search results - page 1 / 10
» Decision Problems for Second-Order Linear Logic
Sort
View
LICS
1995
IEEE
13 years 8 months ago
Decision Problems for Second-Order Linear Logic
The decision problem is studied for fragments of second-order linear logic without modalities. It is shown that the structural rules of contraction and weakening may be simulated ...
Patrick Lincoln, Andre Scedrov, Natarajan Shankar
CSL
2009
Springer
13 years 11 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer
FOCS
1990
IEEE
13 years 9 months ago
Decision Problems for Propositional Linear Logic
Patrick Lincoln, John C. Mitchell, Andre Scedrov, ...
MP
2008
137views more  MP 2008»
13 years 4 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 2 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...