Paolo Bresciani. Uniformly querying knowledge bases and data bases. In Baader et al.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... by CRACK are: feature selection, agreement and disagreement; inverse roles; collections, parts and plural quanti ers; concrete domains; treatment of individuals in the terminological part; principled representation of time, events and plans; interface with relational databases via SQL queries [ Bresciani,1994 ] Moreover, the YAK hybrid modules representing constraints, beliefs and prototypes are still available within CRACK. Another project we are carrying on is the development a completely new knowledge representation language, speci cally for the representation of the relational knowledge ....

Paolo Bresciani. Uniformly querying knowledge bases and data bases. In Working Notes of the Workshop on Reasoning about Structured Objects: Knowledge Representation meets Databases, September 1994. To appear.

....between the DL and SIS Telos query models, the translation of the resulting DL query expressions into our cultural source is straightforward. We plan to extend this interface of Module 4 for other data source technologies, especially relational and object DBMSs (SQL, OQL) as already studied in [10, 13, 32]. To conclude, the modular architecture of the proposed toolkit allows to significantly reduce wrapper development and maintenance costs. First, the DL based Module 4 can be reused in order to wrap the same source according to multiple, possibly overlapping profiles. This is not 17 PersonalName ....

P. Bresciani. Uniformly Querying Knowledge Bases and Data Bases. In Proc. of 1st Workshop KRDB'94, Saarbrucken, Germany, September 1994.

....reasoning about all models using an open world approach. Hence, it is a commonplace that the reasoning possibilities of DOOD are limited compared to that of DLs, and that complementary, due to the complex inference, performance of a DL becomes a problem when large amounts of data are involved [Bre94, Sch95] Particularly, deducing new individuals and relations between them in the A box is very restricted, what in turn is the main task of a deductive database. The complementary characteristics of DOOD and DLs have stimulated a new research direction aiming to combine the best of both worlds. ....

Paolo Bresciani. Uniformly Querying Knowledge Bases and Data Bases. In KRDB, 1994.

No context found.

Paolo Bresciani. Uniformly querying knowledge bases and data bases. In Baader et al.

No context found.

Paolo Bresciani. Uniformly querying knowledge bases and data bases. In F. Baader, M. Buchheit, M. A. Jeusfeld, and W. Nutt, editors, Working Notes of the KI'94 Workshop: KRDB'94 - Reasoning about Structured Objects: Knowledge Representation meets Databases, number D-94-11 in DFKI Documents, pages 58--62, Saarbrucken, Germany, September 1994. DFKI GmbH.

....made to correspond respectively to unary and binary tables in a DB. Two possible way to couple DLMS and DBMS can be proposed: loose coupling (that requires a pre loading of the data from the DB into the KB) and tight coupling (that implements a on demand access to the DB) We implemented a system [Bresciani,1994; 1995b] based on tight coupling, where compound conjunctive queries involving unary and binary predicates can be done without wasting memory space in the DLMS in order to keep descriptions of DBMS data; moreover, answers are given on the basis of the current state of the KB and the DB, without ....

....and DB. As noted in [Borgida and Brachman,1993] KB based on DL are often used in applications where they need access to large amounts of data stored in already existing databases. It is the case, for example, of the TAMIC system [Bagnasco et al. 1996] ffl Knowledge Acquisition. As observed in [Bresciani,1994; 1992] the task of acquiring knowledge for a real knowledge based application often includes a great amount of raw data collecting. For this subtask a DB and its robust front end can be more adequate than usual KB interfaces. ffl Data Archaeology. In data archaeology the main task is the search ....

Paolo Bresciani. Uniformly querying knowledge bases and data bases. In Baader et al. [1994] , pages 58--62.

....database management systems (DBMS) in order to allow, via a query language grounded on a DL based schema knowledge, uniformly formulating and answering queries, so that uniform retrieval from mixed knowledge data bases is possible. In particular, some new developments extending those presented in [ Bresciani, 1994 ] are introduced. By means of them the mapping between DL concepts and DB views is not more limited to primitive concepts, but also to some non primitively defined ones. 1 Introduction The main difference between knowledge representation (KR) and database (DB) systems is that the latter are ....

.... large amounts data, often it is better to manage large portions of data by means of a DBMS; ffl as [ Borgida and Brachman, 1993 ] mentions, KB based on DL are often used in applications where they need access to large amounts of data stored in already existing databases; ffl as observed in [ Bresciani, 1994, Bresciani, 1992 ] the task of acquiring knowledge for a real knowledge based application often includes a great amount of raw data collecting; for this subtask instead of using an ABox often it is better to use databases. In particular we faced these problems when we were developing a large ....

[Article contains additional citation context not shown here]

Paolo Bresciani. Uniformly querying knowledge bases and data bases. In F. Baader, M. Buchheit, M. A. Jeusfeld, and W. Nutt, editors, Working Notes of the KI'94 Workshop: KRDB'94, number D-94-11 in DFKI Documents, pages 58--62, Saarbrucken, Germany, September 1994.

No context found.

P. Bresciani. Uniformly Querying Knowledge Bases and Data Bases. In Proc. of 1st Workshop KRDB'94, Saarbr#ucken, Germany, September 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC