Sciweavers

1796 search results - page 263 / 360
» An Approach to Compositional Model Checking
Sort
View
BMCBI
2010
95views more  BMCBI 2010»
13 years 8 months ago
Modelling p-value distributions to improve theme-driven survival analysis of cancer transcriptome datasets
Background: Theme-driven cancer survival studies address whether the expression signature of genes related to a biological process can predict patient survival time. Although this...
Esteban Czwan, Benedikt Brors, David Kipling
ILP
2007
Springer
14 years 2 months ago
Applying Inductive Logic Programming to Process Mining
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
Evelina Lamma, Paola Mello, Fabrizio Riguzzi, Serg...
AGP
2003
IEEE
14 years 1 months ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
DAC
2004
ACM
14 years 9 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening
ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
14 years 2 months ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange