Results 251 to 260 of about 7,509 (287)
Some of the next articles are maybe not open access.
On the Complexity of H-Subsumption
1999The importance of subsumption as a redundancy elimination method in automated theorem proving is generally acknowledged. For a given Herbrand universe H, it can be further strengthened to the so-called H-subsumption, i.e.: A clause D is H-subsumed by a clause set \({\cal C}\), iff for every H-ground instance Dθ of D there is a clause \(C \in {\cal C}\),
openaire +2 more sources
The British Journal for the Philosophy of Science, 2005
How can the reference of theoretical terms be stable over changes of theory? I defend an approach to this that does not depend on substantive metasemantic theories of reference. It relies on the idea that in contexts of use, terms may play a role in a theory that in turn points to a further (possibly unknown) theory.
openaire +1 more source
How can the reference of theoretical terms be stable over changes of theory? I defend an approach to this that does not depend on substantive metasemantic theories of reference. It relies on the idea that in contexts of use, terms may play a role in a theory that in turn points to a further (possibly unknown) theory.
openaire +1 more source
Subsumption in knowledge graphs
2005An important notion for representation formalisms of natural language semantics, is a subsumption hierarchy. Therefore a precise definition of subsumption is necessary. We shall argue that the usual solution of providing an extensional semantics and mapping subsumption onto set-inclusion, is not satisfactory.
openaire +1 more source
Explaining Subsumption by Optimal Interpolation
2004We describe ongoing research to support the construction of terminologies with Description Logics. For the explanation of subsumption we search for particular concepts because of their syntactic and semantic properties. More precisely, the set of explanations for a subsumption \(P\sqsubseteq N\) is the set of optimal interpolants for P and N.
openaire +2 more sources
2019
Through the use of subsumption architectures, low cost, simple robots can be developed to undertake the hazard of moving a submunition or scatterable mine to a disposal area for neutralization. A number of these robots acting in unison can provide an order of magnitude increase in the ability of one Explosive Ordnance Disposal (EOD) technician to clear
DeBolt, Christopher K. +6 more
openaire +1 more source
Through the use of subsumption architectures, low cost, simple robots can be developed to undertake the hazard of moving a submunition or scatterable mine to a disposal area for neutralization. A number of these robots acting in unison can provide an order of magnitude increase in the ability of one Explosive Ordnance Disposal (EOD) technician to clear
DeBolt, Christopher K. +6 more
openaire +1 more source

