Sciweavers

100 search results - page 10 / 20
» Closure and factor-critical graphs
Sort
View
LICS
1991
IEEE
13 years 11 months ago
On the Deduction Rule and the Number of Proof Lines
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
Maria Luisa Bonet, Samuel R. Buss
SAC
2008
ACM
13 years 7 months ago
Privacy-preserving link discovery
Abstract. Link discovery is a process of identifying association(s) among different entities included in a complex network structure. These association(s) may represent any interac...
Xiaoyun He, Basit Shafiq, Jaideep Vaidya, Nabil R....
TACAS
2009
Springer
99views Algorithms» more  TACAS 2009»
14 years 2 months ago
Ground Interpolation for the Theory of Equality
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krsti...
SEMWEB
2010
Springer
13 years 5 months ago
Optimizing Enterprise-Scale OWL 2 RL Reasoning in a Relational Database System
OWL 2 RL was standardized as a less expressive but scalable subset of OWL 2 that allows a forward-chaining implementation. However, building an enterprise-scale forward-chaining ba...
Vladimir Kolovski, Zhe Wu, George Eadon
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
14 years 7 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...