Sciweavers

Share
DLOG
2011
8 years 29 days ago
Extracting Finite Sets of Entailments from OWL Ontologies
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...
Samantha Bail, Bijan Parsia, Ulrike Sattler
DLOG
2011
8 years 29 days ago
Unchain My EL Reasoner
We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a “left-linear” way in analogy ...
Yevgeny Kazakov, Markus Krötzsch, Frantisek S...
DLOG
2010
8 years 7 months ago
Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
Abstract. This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First,...
Chan Le Duc, Myriam Lamolle
CIKM
2010
Springer
8 years 8 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
SAC
2008
ACM
8 years 9 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....
JCT
2000
96views more  JCT 2000»
8 years 9 months ago
On Tail Distribution of Interpost Distance
A partial order on Z obtained by taking the transitive closure of a random relation {i < j and there is an edge ij} is studied. Randomness stems from postulating that an edge ij...
Jeong Han Kim, Boris Pittel
AAAI
2000
8 years 10 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
ACL
2008
8 years 11 months ago
Event Matching Using the Transitive Closure of Dependency Relations
This paper describes a novel event-matching strategy using features obtained from the transitive closure of dependency relations. The method yields a model capable of matching eve...
Daniel M. Bikel, Vittorio Castelli
DBPL
1995
Springer
106views Database» more  DBPL 1995»
9 years 1 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
COCOA
2009
Springer
9 years 1 months ago
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki...
books