Sciweavers

4555 search results - page 30 / 911
» Deductive Algorithmic Knowledge
Sort
View
MFDBS
1989
102views Database» more  MFDBS 1989»
14 years 2 months ago
Transitive Closure and the LOGA+-Strategy for its Efficient Evaluation
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive que...
W. Yan, Nelson Mendonça Mattos
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 10 months ago
Graph Algorithms for Improving Type-Logical Proof Search
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
Richard Moot
DLOG
2010
13 years 8 months ago
A MapReduce Algorithm for EL+
Abstract. Recently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion...
Raghava Mutharaju, Frederick Maier, Pascal Hitzler
TPHOL
2003
IEEE
14 years 3 months ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
WWW
2008
ACM
14 years 10 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen