A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Filters
Implementing Telos
1991
ACM SIGART Bulletin
This provides the link between the attribute description in a class and the assertion in an instance. ...
Introduction This paper describes experiences in implementing Telos [MBJK90, TK89], a knowledge representation scheme developed at the University of Toronto. ...
This provides the link between the attribute description in a class and the assertion in an instance. ...
doi:10.1145/122296.122307
fatcat:t3oj234oujhchcf6y6amnyl5fu
OILing the way to machine understandable bioinformatics resources
2002
IEEE Transactions on Information Technology in Biomedicine
The nature of the heterogeneity problems are presented along with a description of how metadata from domain ontologies can be used to alleviate this problem. ...
This paper describes a solution derived from the semantic web (a machine understandable WWW), the Ontology Inference Layer (OIL), as a solution for semantic bioinformatics resources. ...
However, the classification scheme, like phrase based vocabularies, is essentially hand-crafted, can suffer from inconsistencies and logical mistakes and is difficult to evolve. ...
doi:10.1109/titb.2002.1006300
pmid:12075667
fatcat:2e6hblgahnfm3jwhenzgoctgeu
Detecting Inconsistencies in the Gene Ontology Using Ontology Databases with Not-gadgets
[chapter]
2009
Lecture Notes in Computer Science
What makes this work relevant is the use of the database itself, rather than an external reasoner, to detect logical inconsistencies given large numbers of annotated instances. ...
We discovered 75 inconsistencies that have important implications in biology, which include: (1) methods for refining transfer rules used for inferring electronic annotations, and (2) highlighting possible ...
DL-Lite [6] makes steps toward bridging the gap between ontologies and databases by defining a complete yet tractable fragment of description logic which closely captures database schema semantics. ...
doi:10.1007/978-3-642-05151-7_15
fatcat:yjm3jz7n55cmrbjspbym47ap3e
Conceptual linking
2001
Proceedings of the tenth international conference on World Wide Web - WWW '01
concepts based on their components; such a scheme is a Description Logic (DL). ...
, a description logic). ...
doi:10.1145/371920.372084
dblp:conf/www/CarrHBG01
fatcat:ssns2nnagfen5pvslrkcmdi4ke
Classification Based Navigation and Retrieval for Picture Archives
[chapter]
1999
Database Semantics
We present the approach being taken by the STARCH project, which is using a Description Logic DL for semantic metadata. ...
We illustrate these claims with a series of examples taken from our prototype system. ...
His interests are in the applications of description logics.
Carole A Goble received the B.Sc degree in Computing and Information Systems from University of Manchester in 1982. ...
doi:10.1007/978-0-387-35561-0_17
fatcat:splwghpvjffutfsmdye3o5eicy
Machine discovery of protein motifs
1995
Machine Learning
A large database of protein fragments is processed using this approach, and several interesting and significant protein motifs are discovered. ...
The second is to present and apply a novel approach to protein motif representation and discovery, which is based on a spatial description logic and the symbolic machine learning paradigm of structured ...
A Spatial Description Logic Description logics are a flame-based representation scheme which make a clear division between concepts (called the terminology) and instances of those concepts (described using ...
doi:10.1007/bf00993382
fatcat:457zihncr5a4rgif32pvu5hse4
SSWAP: A Simple Semantic Web Architecture and Protocol for semantic web services
2009
BMC Bioinformatics
The protocol is based on the W3C-sanctioned first-order description logic language OWL DL. ...
As an open source platform, a discovery server running at http://sswap.info (as in to "swap info") uses the description logic reasoner Pellet to integrate semantic resources. ...
In those cases, the lack of a formal semantic and logic underlying the data model and tagging scheme means that extensions tend to break the standard. ...
doi:10.1186/1471-2105-10-309
pmid:19775460
pmcid:PMC2761904
fatcat:y37msdx7xffp3a7tc22intotba
Description logics for an autonomic IDS event analysis system
2006
Computer Communications
In this paper, we propose an IDS autonomic event analysis system represented by description logics, which allows inferring the attack scenarios and enabling the attack knowledge semantic queries. ...
However, the overwhelming flow of log data generated by IDS hamper security administrators from uncovering the hidden attack scenarios. ...
(Predict logic transform axioms) Fig. 6 , the Entity-Relationship (E-R) diagram is used to represent the PCTCG format. The E-R scheme can be translated into DL description. ...
doi:10.1016/j.comcom.2005.10.038
fatcat:ggqxmrauajhljmwtdt6e4syfbu
Exploring the design of an intentional naming scheme with an automatic constraint analyzer
2000
Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering
We were able to characterize the conditions under which the existing INS scheme works correctly, and evaluate proposed fixes. ...
Lightweight formal modeling and automatic analysis were used to explore the design of the Intentional Naming Sjsteni (INS), a new scheme f o r resource discovery in a dynamic networked environment. ...
We raise issues of naming semantics that arose from our analysis and would be relevant to any intentional naming scheme. ...
doi:10.1109/ase.2000.873646
dblp:conf/kbse/KhurshidJ00
fatcat:wur3apomgbft7l4jzamd6lc2t4
A Rule-Based Agent Framework for Weakly-Structured Scientific Workflows
[chapter]
2013
Lecture Notes in Business Information Processing
This paper gives a Concurrent Transaction Logic (CT R)based formal model for Weakly-structured Scientific Workflows (WsS-WFs) and further implements it in an open source rule language Prova. ...
Compared with the related efforts, the formal model in this paper focuses on conversation-based reactive workflow logic representation and event-driven computation of complex event patterns. ...
For instance, the Prolog rule "p :-assert(event(a)), fail." asserts event(a) into the database even though the execution fails. ...
doi:10.1007/978-3-642-41687-3_27
fatcat:mvafogllcndx7bocgld2o5egkq
A simplied universal relation assumption and its properties
1982
ACM Transactions on Database Systems
One problem concerning the universal relation assumption is the inability of known methods to obtain a database scheme design in the general case, where the real-world constraints are given by a set of ...
the universal relation from its projections onto the selected relation schemes (sets of attributes in the database scheme). ...
Particularly, we give an easy algorithm for finding the set of multivalued dependencies that follow logically from our description of the real world, and we characterize those of our real worlds that can ...
doi:10.1145/319732.319735
fatcat:ixuyssaaq5f7zfw7sqyuopjpie
Ontology-based Knowledge System and Team Verification Tool for Competitive Pokemon
2021
Proceedings of the ... International Florida Artificial Intelligence Research Society Conference
A user can input their team into the tool, and the tool uses a description logic reasoner to classify Pokemon into their appropriate roles. ...
The TeamVerify tool reasons on input rather than access a database of pre-inferred information, so description logic is chosen over first-order logic. ...
Despite this focus on complexity, description logic is still preferred over less complex logics because of Pokémon's use of quantifiers and other logical concepts. ...
doi:10.32473/flairs.v34i1.128544
fatcat:26yb5boljfehzfucnqiyamegoe
Panorama: A database system that annotates its answers to queries with their properties
1996
Journal of Intelligent Information Systems
The process assumes that various assertions about properties of the data have been stored in the database (meta-information). ...
These assertions are then used to infer properties of each answer provided by the system (meta-answers). ...
A database scheme D is a set of relation schemes R 1 , . . . , R n . ...
doi:10.1007/bf00125522
fatcat:5jzaiqkrlfaopbdb6gxz7h3jcu
Ontology research and development. Part 2: A review of ontology mapping and evolving
2002
Journal of Information Science
It is apparent from the reviews that current researches on semi-automatic or automatic ontology research in all the three aspects of generation, mapping and evolving have so far achieved limited success ...
Palopoli et. al. (2000) present two techniques to integrate and abstract database schemes. Scheme integration is to produce a global conceptual scheme from a set of heterogeneous input schemes. ...
A database scheme is another of such lightweight ontology. In the database community, the problems concerning of the integration of heterogeneous database were raised long time ago. ...
doi:10.1177/016555102401054867
fatcat:cyezjyaa55c7bna6ge3pwq5guq
Ontology research and development. Part 2 - a review of ontology mapping and evolving
2002
Journal of information science
It is apparent from the reviews that current researches on semi-automatic or automatic ontology research in all the three aspects of generation, mapping and evolving have so far achieved limited success ...
Palopoli et. al. (2000) present two techniques to integrate and abstract database schemes. Scheme integration is to produce a global conceptual scheme from a set of heterogeneous input schemes. ...
A database scheme is another of such lightweight ontology. In the database community, the problems concerning of the integration of heterogeneous database were raised long time ago. ...
doi:10.1177/016555150202800503
fatcat:fcvuvuxh3zdv5b4w3wxbcyho7m
« Previous
Showing results 1 — 15 out of 16,992 results