We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Our goal is to build knowledge acquisition tools that support users in modifying knowledge-based systems. These modi cations may require several individual changes to various comp...
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...
Humanagents typically evolve a set of standard routines for carrying out often-repeated tasks. These routines effectively compile knowledgeabout howto carry out sets of interactin...
In this paper we show how a natural language system can learn to find the antecedents of relative pronouns. We use a well-known conceptual clustering system to create a case-based...