نتایج جستجو برای: polynomial profiles

تعداد نتایج: 250106  

2014
David Carral Cristina Feier Bernardo Cuenca Grau Pascal Hitzler Ian Horrocks

The OWL 2 profiles are fragments of the ontology language OWL 2 for which standard reasoning tasks are feasible in polynomial time. Many OWL ontologies, however, contain a typically small number of out-of-profile axioms, which may have little or no influence on reasoning outcomes. We investigate techniques for rewriting axioms into the EL and RL profiles of OWL 2. We have tested our techniques ...

Journal: :iranian journal of mathematical chemistry 2012
m. ghorbani m. songhori

the omega polynomial(x) was recently proposed by diudea, based on the length of stripsin given graph g. the sadhana polynomial has been defined to evaluate the sadhana index ofa molecular graph. the pi polynomial is another molecular descriptor. in this paper wecompute these three polynomials for some infinite classes of nanostructures.

Journal: :bulletin of the iranian mathematical society 0
h. s. kim department of mathematics‎, ‎research institute for natural sciences‎, ‎hanyang university‎, ‎seoul 04763‎, ‎korea. p. j. allen department of mathematics‎, ‎university of alabama‎, ‎tuscaloosa‎, ‎al 35487-0350‎, ‎usa. j. neggers department of mathematics‎, ‎university of alabama‎, ‎tuscaloosa‎, ‎al 35487-0350‎, ‎usa.

in this paper, we show how certain metabelian groups can be found within polynomial evaluation groupoids. we show that every finite abelian group can beobtained as a polynomial evaluation groupoid.

Journal: :IEEE Access 2021

The power consumption of buildings over the course each minute, hour, day and season plays a major role in how this load influences Electric Power System voltage frequency, vice versa. This is based on building’s component types, efficiencies, they consume react to changes real time. Due complexity, standard full-building models are typically voltage-invariant. paper proposes novel framework tr...

2003
Jadwiga Indulska Ricky Robinson Andry Rakotonirainy Karen Henricksen

2007
Kristy Elizabeth Boyer Mladen A. Vouk James C. Lester

Tutorial dialogue has been the subject of increasing attention in recent years, and it has become evident that empirical studies of human-human tutorial dialogue can contribute important insights to the design of computational models of dialogue. Students with particular characteristics may have specific dialogue profiles, and knowledge of such profiles could inform the design of tutorial dialo...

We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.

Journal: :CoRR 2014
Adam Clearwater Clemens Puppe Arkadii M. Slinko

We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those orders have transitive majority relation. We prove that for any tree there exist profiles that are single-crossing on that tree; moreover, that tree is minima...

2015
Nuno Costa Matthias Knorr João Leite

The Protégé plug-in NoHR allows the user to combine an OWL 2 EL ontology with a set of nonmonotonic (logic programming) rules – suitable, e.g., to express defaults and exceptions – and query the combined knowledge base (KB). The formal approach realized in NoHR is polynomial (w.r.t. data complexity) and it has been shown that even very large health care ontologies, such as SNOMED CT, can be han...

2015
Nuno Costa Matthias Knorr João Leite

The Protégé plug-in NoHR allows the user to combine an OWL 2 EL ontology with a set of non-monotonic (logic programming) rules – suitable, e.g., to express defaults and exceptions – and query the combined knowledge base (KB). The formal approach realized in NoHR is polynomial (w.r.t. data complexity) and it has been shown that even very large health care ontologies, such as SNOMED CT, can be ha...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید