40 search results - page 1 / 8 » On Generalization and Subsumption for Ordered Clauses |
76
Voted
JSAI
2005
Springer
15 years 3 months ago
2005
Springer
: In this paper, we introduce ordered clauses as defined a sequence of literals, and investigate the properties of generalizations for ordered clauses. Furthermore, we show that t...
CADE
1997
Springer
15 years 1 months ago
1997
Springer
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...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
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...
CADE
1998
Springer
15 years 2 months ago
1998
Springer
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
ILP
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...