Sciweavers

228 search results - page 40 / 46
» A Theory of Restrictions for Logics and Automata
Sort
View
BMCBI
2006
147views more  BMCBI 2006»
13 years 8 months ago
A case study in pathway knowledgebase verification
Background: Biological databases and pathway knowledgebases are proliferating rapidly. We are developing software tools for computer-aided hypothesis design and evaluation, and we...
Stephen A. Racunas, Nigam Shah, Nina V. Fedoroff
JLP
2006
138views more  JLP 2006»
13 years 8 months ago
Algebraic-coalgebraic specification in CoCasl
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...
Till Mossakowski, Lutz Schröder, Markus Rogge...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 6 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
DAM
2011
13 years 3 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
CADE
2005
Springer
14 years 9 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison