1404 search results - page 108 / 281 » Complexity of admissible rules |
CSL
2004
Springer
14 years 2 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
EUROGP
2004
Springer
14 years 2 months ago
2004
Springer
Lymphoma cancer classification with DNA microarray data is one of important problems in bioinformatics. Many machine learning techniques have been applied to the problem and produc...
LATIN
2004
Springer
14 years 2 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
Discrimination discovery in databases consists in finding unfair practices against minorities which are hidden in a dataset of historical decisions. The DCUBE system implements t...
FASE
2009
Springer
14 years 27 days ago
2009
Springer
Model checking tools based on the iterative refinement of predicate abstraction (e.g., Slam and Blast) often feature a specification language for expressing complex behavior rules....