Sciweavers

3758 search results - page 2 / 752
» A Complete Subsumption Algorithm
Sort
View
FUIN
2008
98views more  FUIN 2008»
13 years 5 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
ESOP
2008
Springer
13 years 6 months ago
Regular Expression Subtyping for XML Query and Update Languages
Abstract. XML database query languages such as XQuery employ regular expression types with structural subtyping. Subtyping systems typically have two presentations, which should be...
James Cheney
SAC
2008
ACM
13 years 4 months ago
Towards a complete SCM ontology: the case of ontologising RosettaNet
This paper presents a methodology to derive a Supply Chain Management Ontology based on the RosettaNet specification framework. A prototype to mechanically derive a core ontology ...
Armin Haller, Jedrzej Gontarczyk, Paavo Kotinurmi
CADE
1997
Springer
13 years 8 months ago
A Classification of Non-liftable Orders for Resolution
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy...
Hans de Nivelle
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
13 years 10 months ago
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
Flaviu Adrian Marginean