Sciweavers

5595 search results - page 14 / 1119
» Comparing Subsumption Optimizations
Sort
View
ER
2006
Springer
157views Database» more  ER 2006»
13 years 11 months ago
Representing Transitive Propagation in OWL
Transitive propagation along properties can be modelled in various ways in the OWL description logic. Doing so allows existing description logic reasoners based on the tableaux alg...
Julian Seidenberg, Alan L. Rector
AAAI
1994
13 years 8 months ago
A Description Classifier for the Predicate Calculus
A description classifier organizes concepts and relations into a taxonomy based on the results of subsumption computations applied to pairs of relation definitions. Until now, des...
Robert M. MacGregor
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
14 years 17 days 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
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 4 months ago
XSB: Extending Prolog with Tabled Logic Programming
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
Terrance Swift, David Scott Warren
TCS
2008
13 years 7 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev