31 search results - page 6 / 7 » On the Complexity of Equational Horn Clauses |
ECML
2007
Springer
13 years 12 months ago
2007
Springer
The availability of techniques for comparing descriptions has many applications in Artificial Intelligence, ranging from description selection to flexible matching, from instance...
AAAI
1993
13 years 7 months ago
1993
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
AAAI
2000
13 years 7 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
GECCO
2007
Springer
13 years 12 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
LOGCOM
2000
13 years 5 months ago
2000
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...