Sciweavers

233 search results - page 29 / 47
» Intelligent compilers
Sort
View
AAAI
2000
14 years 11 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val
AAAI
1997
14 years 11 months ago
A Script-Based Approach to Modifying Knowledge Bases
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...
Yolanda Gil, Marcelo Tallis
AAAI
1993
14 years 11 months ago
Supporting and Optimizing Full Unification in a Forward Chaining Rule System
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...
Howard E. Shrobe
AIPS
1994
14 years 11 months ago
Adapting Routines to Improve Task Coordination
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...
Michael Freed, Gregg Collins
AAAI
1992
14 years 10 months ago
Learning to Disambiguate Relative Pronouns
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...
Claire Cardie