Sciweavers

300 search results - page 44 / 60
» An extension of the Cayley-Sylvester formula
Sort
View
LICS
2009
IEEE
15 years 4 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
TABLEAUX
2009
Springer
15 years 4 months ago
Taming Displayed Tense Logics Using Nested Sequents with Deep Inference
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
Rajeev Goré, Linda Postniece, Alwen Tiu
JCSS
2000
121views more  JCSS 2000»
14 years 9 months ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...
BMCBI
2011
14 years 1 months ago
Robust joint analysis allowing for model uncertainty in two-stage genetic association studies
Background: The cost efficient two-stage design is often used in genome-wide association studies (GWASs) in searching for genetic loci underlying the susceptibility for complex di...
Dongdong Pan, Qizhai Li, Ningning Jiang, Aiyi Liu,...
ATAL
2006
Springer
15 years 1 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...