A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Inferray
2016
Proceedings of the VLDB Endowment
Preserved Fulltext
Our measurements on synthetic and real-world datasets show improvements over competitors on RDFS-Plus, and up to several orders of magnitude for transitivity closure. ...
using ad-hoc optimizations on MSD radix and a custom counting sort; 3) a dedicated temporary storage to perform efficient graph closure computation. ...
The authors would also like to thank Satish Nadathur for his help on sorting algorithms, Jacopo Urbani for his help with WebPIE and QueryPIE and the authors of RDFox for their help in configuring their ...
doi:10.14778/2904121.2904123
fatcat:6ncfo5nx2zbydihf4dbxlzgc6q
On the Floyd–Warshall algorithm for logic programs
1999
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We characterize exactly the single rule chain programs that can be so evaluated ± they are rather modest generalizations of the transitive closure. ...
We explore the possibility of evaluating single-rule Datalog programs eciently and with logarithmic work space by a natural extension of the Floyd±Warshall algorithm for transitive closure. ...
A chain program is a Datalog program with only chain rules. The transitive closure program in the introduction is a single-rule chain program (a chain sirup). ...
doi:10.1016/s0743-1066(99)00013-8
fatcat:kdhy2fv5vzcbxfq2ztv7gk6pha
Page 295 of Duke Mathematical Journal Vol. 9, Issue 2
[page]
1942
Duke Mathematical Journal
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Again, consider the closure property of complete lattices under ordinal multi- plication. ...
The closure rules for lattices under ordinal multiplication and exponentiation are so curious as to deserve special mention. ...
Page 295 of Duke Mathematical Journal Vol. 9, Issue 2
[page]
1942
Duke Mathematical Journal
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Again, consider the closure property of complete lattices under ordinal multi- plication. ...
The closure rules for lattices under ordinal multiplication and exponentiation are so curious as to deserve special mention. ...
Taking the RDF Model Theory Out for a Spin
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we give some results in our investigation of a practical implementation of the entailment rules, based on the graph-walking query mechanism of the Wilbur RDF toolkit. ...
to have to realize the vision of the "Semantic Web". ...
, Louis Theran and the anonymous reviewers of the ISWC program committee. ...
doi:10.1007/3-540-48005-6_24
fatcat:datwhsgqlvfivhpn47oklexbey
Enumeration of Ring–Chain Tautomers Based on SMIRKS Rules
2014
Journal of Chemical Information and Modeling
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Based on Baldwin's Rules estimating the likelihood of ring closure reactions to occur, we have defined a set of transform rules covering the majority of ring−chain tautomerism cases. ...
We report on the application of our ring−chain tautomerism rules to a large database of commercially available screening samples in order to identify ring−chain tautomers. Figure 1. ...
The group of favored ring closures/openings constitutes the set of our 11 ring−chain tautomerism rules shown in Table 2 . ...
doi:10.1021/ci500363p
pmid:25158156
pmcid:PMC4170818
fatcat:rsc7myzopjch3hojiav7yv5p4i
SPARQL query answering with bitmap indexes
2012
Proceedings of the 4th International Workshop on Semantic Web Information Management - SWIM '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
., data defined by sets of rules. This is usually achieved through forward chaining, with space and maintenance overheads, or backward chaining, with high query evaluation and optimization costs. ...
Recent approaches rely on pre-computing the terminological closure of the data rather than the full saturation. ...
Finding all the triples entailed w.r.t. a dataset and a set of rules is generally done through forward or backward chaining. ...
doi:10.1145/2237867.2237876
dblp:conf/sigmod/Leblay12
fatcat:4land3jf2zalfnejh427oou7pm
Recursive domains in proteins
2009
Protein Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Specifically, can a small number of intuitively sensible rules generate a large class of folds, including feasible new folds? ...
In this paper, we explore the extent to which four simple rules can generate the known all- folds, using tools from graph theory. ...
The publication costs of this article were defrayed in part by payment of page charges. ...
doi:10.1110/ps.24701
pmid:11790851
pmcid:PMC2373444
fatcat:hle4i4yh3jdvdetn6ekcitdi2m
Toward a theory of input-driven locally parsable languages
2017
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
properties of grammar derivations. ...
The new class of locally chain parsable languages (LCPLs), included in the deterministic context-free language family, is here defined by means of the chain-driven automaton and characterized by decidable ...
Therefore, IDL closure properties can be derived as a special case of the closure properties of OPL. Theorem 11. Every OPG is locally chain-parsable. ...
doi:10.1016/j.tcs.2016.05.003
fatcat:sa3xk75i5rehbkglcy2ht6onxi
Differentiation-Free Taylor Approximation of Finite Motion in Closed Loop Kinematics
[chapter]
2017
Mechanisms and Machine Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Screw theory and its associated Lie group theory have been used to find these derivatives of loop closure equations up to an arbitrary order. ...
It depends on a simplified representation of the higherorder derivatives of an open chain. From these higher-order derivatives a Taylor expansion of a finite motion becomes available. ...
This is done by consecutive application of the chain rule, the product rule, and the inverse matrix derivative to the Jacobian (16) . ...
doi:10.1007/978-3-319-60867-9_66
fatcat:vipaaiymrjgp7gn7unwarmmw5e
4s-reasoner: RDFS Backward Chained Reasoning Support in 4store
2010
2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper describes the design and implementation of backward chained clustered RDFS reasoning in 4store. ...
We also demonstrate that our solution scales over clusters of commodity servers providing an optimal solution that balances infrastructure cost and performance over tested data sets with up to 500M triples ...
) ∨ o ∈ O ∨ O = ∅} In Phase 2 for the bounded P and O the transitive sub-closure of properties and classes are made part of the matching process. closure p (P ) is the transitive closure of the set of ...
doi:10.1109/wi-iat.2010.35
dblp:conf/iat/SalvadoresCOGHS10
fatcat:r3mjev3jkrcixdpx6b6g7yxiua
QueryPIE: Backward Reasoning for OWL Horst over Very Large Knowledge Bases
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Materialization enables very efficient responses at query time, but at the cost of an expensive up front closure computation, which needs to be redone every time the knowledge base changes. ...
Both materialization and backward-chaining as different modes of performing inference have complementary advantages and disadvantages. ...
In this tree, the reasoner fires rule O3 (concerning symmetric properties in OWL) to be applied on the second antecedent of rule R4. ...
doi:10.1007/978-3-642-25073-6_46
fatcat:o6zepb5y2rbznoo6rdtvy3mw7a
Topological structures for modeling engineering design processes
2003
Research in Engineering Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We demonstrate that our model has the desirable quality of representing several, seemingly distinct, approaches as instances of the same framework. ...
Various design phenomena such as design failure, identification of design knowledge bottlenecks, and benefits of collaborative design could be understood using the proposed model. ...
Rule-based systems are useful for this illustrative purpose since their two methods of control-forward chaining and backward chaining-can be construed as forms of analysis and synthesis. ...
doi:10.1007/s00163-003-0035-3
fatcat:n7ppienbyfds7gce4pwe5ok424
Proving self-stabilization with a proof assistant
2002
Proceedings 16th International Parallel and Distributed Processing Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We present a formalization of a proof of self-stabilization in the Coq proof assistant. ...
Coq is a program allowing to define mathematical objects and properties, and to make proofs on them in a certified way. ...
As we said in section 3, there are three kinds of rules, corresponding to three different context closure. ...
doi:10.1109/ipdps.2002.1016619
dblp:conf/ipps/Courtieu02
fatcat:fusq6qnhgjawtgxmirecm2prlm
Large Scale Fuzzy pD * Reasoning Using MapReduce
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The experimental results show that the running time of our system is comparable with that of WebPIE, the state-of-the-art inference engine for scalable reasoning in pD * semantics. ...
To the best of our knowledge, this is the first work to investigate how MapReduce can help to solve the scalability issue of fuzzy OWL reasoning. ...
Since for any fuzzy triple (a, p, b) [m] , there is at least one chain u 0 = a, u 1 , ..., u k = b according to Property 2, we use variable length to indicate the length of the shortest chain of (a, p ...
doi:10.1007/978-3-642-25073-6_26
fatcat:f5zqayakbrgmtmrbbvixssb3se
« Previous
Showing results 1 — 15 out of 78,950 results