Results 221 to 230 of about 1,544 (260)
Some of the next articles are maybe not open access.
1999
The paper examines query subsumptions in a relational context and develops a general subsumption technique for queries with function-free firstorder predicates. The predicates are compacted (removing redundant terms) and then expressed as of a disjunction of conjunctions without negations, which is then transformed into a canonical form, along with the
S. Misbah Deen, Mohammad Al-Qasem
openaire +1 more source
The paper examines query subsumptions in a relational context and develops a general subsumption technique for queries with function-free firstorder predicates. The predicates are compacted (removing redundant terms) and then expressed as of a disjunction of conjunctions without negations, which is then transformed into a canonical form, along with the
S. Misbah Deen, Mohammad Al-Qasem
openaire +1 more source
2002
The intuitive simplicity of the so-called is-a (or subsumption) relationship has led to widespread ontological misuse. Where previous work has focused largely on the semantics of the relationship itself, we concentrate here on the ontological nature of its arguments, in order to tell whether a single is-a link is ontologically well-founded.
Nicola Guarino, Christopher Welty
openaire +1 more source
The intuitive simplicity of the so-called is-a (or subsumption) relationship has led to widespread ontological misuse. Where previous work has focused largely on the semantics of the relationship itself, we concentrate here on the ontological nature of its arguments, in order to tell whether a single is-a link is ontologically well-founded.
Nicola Guarino, Christopher Welty
openaire +1 more source
1998
We propose several methods for writing efficient subsumption procedures for non-unit clauses, tested in practice as parts incorporated into the Gandalf family of theorem provers. Versions of Gandalf exist for classical logic, first order intuitionistic logic and type theory.
openaire +1 more source
We propose several methods for writing efficient subsumption procedures for non-unit clauses, tested in practice as parts incorporated into the Gandalf family of theorem provers. Versions of Gandalf exist for classical logic, first order intuitionistic logic and type theory.
openaire +1 more source
Generalized Mutant Subsumption
Proceedings of the 17th International Conference on Software Technologies, 2022Samia Al Blwi +5 more
openaire +1 more source
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
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 +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