1522 search results - page 12 / 305 » On the Complexity of Several Haplotyping Problems |
LICS
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
ICLP
2001
Springer
14 years 2 days ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
UAI
2008
13 years 9 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
AML
2007
13 years 7 months ago
2007
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...