A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Filters
Explicity Using Default Knowledge in Concept Learning: An Extended Description Logics Plus Strict and Default Rules
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
Least Common Subsumer in C-CLASSIC δ As mentioned above, learning in C-CLASSIC δ relies both on the subsumption relation and on the computation of the Least Common Subsumer (LCS) 5 of two concept definitions ...
The same LCSLEARNDISJ algorithm can be used as polynomial subsumption and Least Common Subsumer algorithms have been defined on C-CLASSIC δ . ...
doi:10.1007/3-540-45402-0_13
fatcat:ql5nzh77krgdfhqenmvntqqwzu
Computing the Least Common Subsumer w.r.t. a Background Terminology
[chapter]
2004
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 2016; you can also visit the original URL.
The file type is application/pdf.
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive DLs whereas existing knowledge bases are written in very expressive DLs. ...
re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions to the notion of the lcs w.r.t. a ...
Introduction and problem definition Non-standard inferences such as computing the least common subsumer can be used to support the bottom-up construction of DL knowledge bases, as introduced in [4, 5] ...
doi:10.1007/978-3-540-30227-8_34
fatcat:r5bmxfvtjnhy5i7yh3rjh7kzk4
Computing the least common subsumer w.r.t. a background terminology
2007
Journal of Applied Logic
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 2016; you can also visit the original URL.
The file type is application/pdf.
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive DLs whereas existing knowledge bases are written in very expressive DLs. ...
re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions to the notion of the lcs w.r.t. a ...
Introduction and problem definition Non-standard inferences such as computing the least common subsumer can be used to support the bottom-up construction of DL knowledge bases, as introduced in [4, 5] ...
doi:10.1016/j.jal.2006.03.002
fatcat:m7unmigbe5b2bkwmvljpmem5s4
From Meaningful Orderings in the Web of Data to Multi-level Pattern Structures
[chapter]
2017
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.
We define a pattern structure whose objects are elements of a supporting ontology. ...
The specificity of the descriptions depends on a hyperparameter corresponding to their depth. ...
This enables us to define a similarity (or meet) operator by, for a, b ∈ X, a b is the least common subsumer of a and b. ...
doi:10.1007/978-3-319-60438-1_61
fatcat:4vxkvvquvfcztcbzkah4rceeoy
Subsumption and Connection Graphs
[chapter]
1981
GWAI-81
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.
A subsumption test based on the principal idea of Kowalski's connection graph proof procedure is developed. ...
The test is not limited to the connection graph proof procedure, but most naturally embedded into it. ...
Kowalski's connection graph proof proce dure [K751 represents a set of logical for mulae not as a set but as a graph like structure. ...
doi:10.1007/978-3-662-02328-0_17
dblp:conf/ki/Eisinger81
fatcat:avbylmp5wrgetnzjhbpp6bxgau
Sonic — Non-standard Inferences Go OilEd
[chapter]
2004
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 2011; you can also visit the original URL.
The file type is application/pdf.
The contribution of our implementation is twofold: it extends an earlier implementation of the least common subsumer and of the approximation inference to number restrictions, and it offers these reasoning ...
Sonic 1 is the first prototype implementation of non-standard inferences for Description Logics usable via a graphical user interface. ...
The approximation of a concept description C from a DL L 1 is defined as the least concept description (w.r.t. subsumption) in a DL L 2 that subsumes C. ...
doi:10.1007/978-3-540-25984-8_22
fatcat:f45xwr4f7zbkpm3e2weh6x77ta
Broadcast of Local Eligibility for Multi-Target Observation
[chapter]
2000
Distributed Autonomous Robotic Systems 4
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.
We i n troduce the Broadcast of Local Eligibility BLE as a general tool for coordination between robots, and then demonstrate its application to the CMOMMT 8 multi-target observation task. ...
We present a BLE approach to the CMOMMT multi-target observation problem, implemented on a team of physical robots. ...
Local Subsumption Only The Local Subsumption LS controller is the same as the BLE controller, but connections are not made across the peer groups so that no cross-inhibition takes place. ...
doi:10.1007/978-4-431-67919-6_33
fatcat:zki4szyyf5hbhml4vk4pe6x4ti
Semantic-Oriented Description Techniques for Network Management Information Modeling
[chapter]
1995
IFIP Advances in Information and Communication 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 2020; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a semantic-oriented approach to classifying network management information so that the formal description of network states can be supported. ...
We apply the situation classification capability extended from those found in KL-ONE or Description Logic, in order to organize the state and event for network management in a hierarchical structure. ...
For instance, Situation B: "A connection has at least one failure at night" {::::} <has, connection, <atleast, 1,failures>, lb, night, 1> is a defined situation type. ...
doi:10.1007/978-0-387-34878-0_2
fatcat:6khepbuz6vfgdbcujtfsfvfpge
Towards refactoring the Molecular Function Ontology with a UML profile for function modeling
2017
Journal of Biomedical Semantics
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.
Moreover, modeling and refactoring large ontologies such as GO is generally far from being simple, as a whole as well as when focusing on certain aspects or fragments. ...
It seems that human-friendly graphical modeling languages such as the Unified Modeling Language (UML) could be helpful in connection with these tasks. ...
Acknowledgements This paper is an extended version of a submission [37] presented at the International Conference on Biomedical Ontology (ICBO) 2015. ...
doi:10.1186/s13326-017-0152-y
pmid:28978337
pmcid:PMC5628467
fatcat:vyzxufnszrdhrjpxs3hlky26hy
Generative Models for Global Collaboration Relationships
[article]
2016
arXiv
pre-print
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.
Other Versions
When individuals interact with each other and meaningfully contribute toward a common goal, it results in a collaboration, as can be seen in many walks of life such as scientific research, motion picture ...
Unlike graphs, in SCs, both facet degrees (of nodes) and facet sizes are important to capture connectivity properties. ...
In the hypergraph, a dark node denotes an author who has written least one paper as a sole author. ...
arXiv:1606.08079v2
fatcat:lm6qut5dlfdqvlifebko2q5spm
The Functional Perspective on Advanced Logic Programming
2016
International Conference on 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 2022; you can also visit the original URL.
The file type is application/pdf.
However, more advanced techniques, such as tabling, answer subsumption and probabilistic logic programming fail to attract the attention of a larger audience. ...
The basics of logic programming, as embodied by Prolog, are generally well-known in the programming language community. ...
© Alexander Vandenbroucke; licensed under Creative Commons License CC-BY ...
doi:10.4230/oasics.iclp.2016.20
dblp:conf/iclp/Vandenbroucke16
fatcat:ljbcyks7tne63kbjlbgvyf37va
Taxonomic plan reasoning
1996
Artificial Intelligence
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.
CLASP supports subsumption inferences between plan concepts and other plan concepts, as well as between plan concepts and plan instances. ...
Classification uses subsumption to find the correct place for a frame in a taxonomy. 0004-3702/96/$15X10 @ 1996 Elsevier Science B.V. ...
Acknowledgements We would like to thank Ron Brachman and Henry Kautz for comments on a preliminary version of this paper, which appeared in [ 121. ...
doi:10.1016/0004-3702(95)00091-7
fatcat:oa6b2qz3drdqnhumofw7ekfixq
Compiler optimizations for nondeferred reference
2006
Proceedings of the 2006 international symposium on Memory management - ISMM '06
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 2007; you can also visit the original URL.
The file type is application/pdf.
We report execution time improvements on a benchmark suite of ten C# programs, and show how RC subsumption, aided with other optimizations, improves the performance of nondeferred RC collection by as much ...
This is in the context of a baseline RC implementation that is typically at least a factor of 6 slower than the tracing collector and a factor of 5 slower than the deferred RC collector. ...
The Type Connectivity Graph A type connectivity graph GT = (VT , ET ) has nodes representing types and directed edges summarizing the connections between type instances. ...
doi:10.1145/1133956.1133976
dblp:conf/iwmm/Joisha06
fatcat:hiseyyeiqralzgeoavke6ls36m
Efficient θ-subsumption based on graph algorithms
[chapter]
1997
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 2020; you can also visit the original URL.
The file type is application/pdf.
subsumption is a decidable but incomplete approximation of logic implication, important to inductive logic programming and theorem proving. ...
We show that by context based elimination of possible matches a certain superset of the determinate clauses can be tested for subsumption in polynomial time. ...
The graph context at a larger depth contains more information, namely information about literals that are connected via a chain of common variables. ...
doi:10.1007/3-540-63494-0_57
fatcat:3tvz3rnh4zfvlb77uaefwf5dpi
Ayllu: Distributed Port-Arbitrated Behavior-Based Control
[chapter]
2000
Distributed Autonomous Robotic Systems 4
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 2004; you can also visit the original URL.
The file type is application/pdf.
, heterogenous platforms, and a lack of standardized tools or techniques. ...
Distributed control of a team of mobile robots presents a number of unique challenges, including highly unreliable communication, real world task and safety constraints, scalability, dynamic recon gurability ...
Each i s then joined by broadcast connections into a cross-inhibiting peer group which consists of Observers of the same target on each robot connected as seen in Figure 1a , producing a cross-subsumption ...
doi:10.1007/978-4-431-67919-6_3
fatcat:frej74ewlzfeti2xvfq2koaft4
« Previous
Showing results 1 — 15 out of 9,781 results