Sciweavers

23 search results - page 2 / 5
» Reasoning about Knowledge by Variable Forgetting
Sort
View
DLOG
2007
13 years 7 months ago
Modal Logic Applied to Query Answering and the Case for Variable Modalities
We present a query answering technique based on notions and results from modal Correspondence Theory. It allows us to answer a wide family of conjunctive queries by polynomial redu...
Evgeny Zolin
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
13 years 11 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
SIGSOFT
2005
ACM
13 years 10 months ago
PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code
Programs usually follow many implicit programming rules, most of which are too tedious to be documented by programmers. When these rules are violated by programmers who are unawar...
Zhenmin Li, Yuanyuan Zhou
BMCBI
2008
139views more  BMCBI 2008»
13 years 4 months ago
The C1C2: A framework for simultaneous model selection and assessment
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg
IJCAI
2001
13 years 6 months ago
Context-specific Sign-propagation in Qualitative Probabilistic Networks
ive probabilistic networks are qualitative abstractions of probabilistic networks, summarising probabilistic influences by qualitative signs. As qualitative networks model influen...
Silja Renooij, Simon Parsons, Linda C. van der Gaa...