Sciweavers

150 search results - page 13 / 30
» Parameterized Modal Satisfiability
Sort
View
ENTCS
2010
119views more  ENTCS 2010»
13 years 7 months ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
14 years 4 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
MFCS
2010
Springer
13 years 5 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
FUIN
2000
71views more  FUIN 2000»
13 years 7 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
CDC
2009
IEEE
103views Control Systems» more  CDC 2009»
14 years 6 days ago
A new decentralization technique for interconnected systems
— This paper deals with LTI interconnected systems whose subsystems have coupled dynamics. The objective is to decentralize a given centralized controller satisfying some prescri...
Javad Lavaei