Sciweavers

120 search results - page 14 / 24
» Experimenting with Deduction Modulo
Sort
View
JSC
2010
102views more  JSC 2010»
14 years 8 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu
CAV
2009
Springer
182views Hardware» more  CAV 2009»
15 years 4 months ago
Generalizing DPLL to Richer Logics
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
Kenneth L. McMillan, Andreas Kuehlmann, Mooly Sagi...
KBSE
1998
IEEE
15 years 1 months ago
Specification-based Browsing of Software Component Libraries
Specification-based retrieval provides exact contentoriented access to component libraries but requires too much deductive power. Specification-based browsing evades this bottlene...
B. Fischer
AAAI
2008
14 years 11 months ago
Computing Observation Vectors for Max-Fault Min-Cardinality Diagnoses
Model-Based Diagnosis (MBD) typically focuses on diagnoses, minimal under some minimality criterion, e.g., the minimal-cardinality set of faulty components that explain an observa...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
JCIT
2007
91views more  JCIT 2007»
14 years 9 months ago
A Study on Successful Business Intelligence Systems in Practice
Although the concept of Business Intelligence (BI) Systems is still emerging, nowadays many global companies like Agfa, POSCO, TDS Telecom and etc are implementing BI systems as t...
Sarvar R. Abdullaev, Il Seok Ko