[PDF] Top 20 Games for query inseparability of description logic knowledge bases
Has 10000 "Games for query inseparability of description logic knowledge bases" found on our website. Below are the top 20 most common "Games for query inseparability of description logic knowledge bases".
Games for query inseparability of description logic knowledge bases
... KB inseparability is useful in applications where data is stable—such as knowledge exchange or variants of module extraction and forgetting with fixed data—in order to use the KB in a new application or as ... See full document
50
Query inseparability by games
... conjunctive query inseparability of description logic knowledge bases (KBs) with respect to a given signature, a fundamental prob- lem for KB versioning, module extraction, ... See full document
14
Query inseparability for description logic knowledge bases
... Σ-query inseparability for KBs in more expressive Horn DLs ...Our games can also be used to define efficient approximations of Σ-query entailment and inseparability for ... See full document
22
When are description logic knowledge bases indistinguishable?
... Most interesting are E XP T IME - and 2E XP T IME -complete- ness of DL-Lite H core and Horn-ALCI, respectively, which contrast with NP- and E XP T IME -completeness of CQ eval- uation in these logics. For DL-Lite ... See full document
8
Model Comparison Games for Horn Description Logics
... on description logic research and applications: while the weaker Horn DLs of the EL [7] and DL-Lite [8], [9] families gave rise to two Web Ontology Language OWL 2 profiles (trading expressiveness for high ... See full document
15
An introduction to description logics and query rewriting
... input knowledge base and, second, no algo- rithm can check satisfiability of any given knowledge base in polynomial ...over knowledge bases in expressive languages has not become practical so ... See full document
51
Query rewriting under linear EL knowledge bases
... work. Query rewriting has been extensively employed in query answering under ontologies [10, 16, ...resolution-based query rewriting algorithm for DL-Lite+ ontologies (which is EL `in ), with Linear ... See full document
16
Conjunctive query inseparability of OWL 2 QL TBoxes
... of description logics, is emerging as a major language for developing new ontologies and approximating the exist- ing ...background knowledge for answering queries over ...of query ... See full document
16
Query based entailment and inseparability for ALC ontologies
... using description logic (DL) TBoxes has become one of the most important applications of DLs [Poggi et ...background knowledge for the data (stored in an ABox), and thereby derive more complete ... See full document
8
Module extraction via query inseparability in OWL 2 QL
... background knowledge, and thereby en- able query answering over incomplete and semistructured data via a high-level conceptual ...a description logic that was originally introduced under the ... See full document
12
When is query inseparability for ALC Ontologies decidable?
... While query answering with Description Logics (DLs) is now well-developed, this is much less the case for reasoning services that support ontology engineering and target query answering as an ... See full document
5
Improving Slot Filling Performance with Attentive Neural Networks on Dependency Structures
... between query and can- didate filler, as well as their rich contextual ...a query q and can- didate filler f , we first apply the Stanford Depen- dency Parser (Manning et ...tween query and candidate ... See full document
10
Parity games and automata for game logic
... game logic in terms of parity ...game logic graphs, ...the logic [18, 28, ...game logic is out of reach, but a careful analysis of the cycle structure of game logic graphs might yield ... See full document
17
Rationality and the Reflective Mind by Keith E. Stanovich
... Stanovich suggests that IQ tests are not entirely suc- cessful, however, at eliminating general knowledge, and, with respect to override, mentions mind wandering in passing (p. 51, p. 70), to which we might add ... See full document
8
When is Lying the Right Choice?
... controlled query evaluation approaches — thus relying on general ways to represent domain ...advanced description logic, namely SDL-Lite, which is built on top of DL-lite, extending it with ... See full document
7
Rough Description Logic Programs
... rough description logic programs (rough dl-programs) under the answer set semantics, which generalize the tightly coupled description logic programs by rough set theory in both the ... See full document
7
The philosophical foundations of Kristeva's thought
... This early emphasis on the inseparability of logic and politics and on the role of history in their relation that is to say, Kristeva's 'rediscovery' of Hegelian dialectic recalls implic[r] ... See full document
314
SQOPI: Semantic Query Optimization Framework
... calling query against the TPCD database and getting the results back via the SQOPIDataReader object, looping through the records returned by and displaying each record as String (actually comma separated ... See full document
6
Schema.org as a Description Logic
... our query evaluation problem, then that problem is not ...defined query evaluation problem: paths with defects are ‘yes’-instances, but can be identified by an ... See full document
21
Query Processing for Retrieval From Large Text Bases
... QUERY PROCESSING FOR RETRIEVAL FROM LARGE TEXT BASES Q U E R Y P R O C E S S I N G F O R R E T R I E V A L F R O M L A R G E T E X T B A S E S John Broglio and W Bruce Croft Computer Science Departmen[.] ... See full document
5
Related subjects