摘要:

We study the effect of adding a rule to a rule‐based heuristic classification expert system, in particular, a rule that causes an unforeseen interaction with rules already in the rule set. We show that it is possible for such an interaction to occur betweensetsof rules, even when no interaction is present between anypairof rules contained in these sets. A method is presented that identifies interactions between sets of rules, and an analysis is given which relates these interactions to rule‐based programming practices which help to maintain die integrity of the knowledge base. We argue mat the method is practical, given some reasonable assumptions on the knowledge b

ISSN:0824-7935    

DOI:10.1111/j.1467-8640.1987.tb00179.x

出版商:Blackwell Publishing Ltd    

年代:1987

数据来源: WILEY

摘要:

One of the most important ways in which an information‐provider can assimilate an information‐seeking dialogue is by inferring the underlying task‐related plan motivating the information‐seeker's queries. This paper presents a strategy for hypothesizing and tracking the changing task‐level goals of an information‐seeker and building a model of his task‐related plan as the dialogue progresses.Naturally occurring utterances are often imperfect. The information‐provider often appears to use acquired knowledge about the information‐seeker's underlying task‐related plan to remedy many of the information‐seeker's faulty utterances and enable the dialogue to continue without interruption. This paper presents a strategy for understanding one kind of defective utterance. Our approach relies on the information‐seeker's inferred task‐related plan as the primary mechanism for suggesting how an utterance should be understood, thereby considering only interpretations that are relevant to what the information‐seeker is trying to accomplish. If multiple interpretations are suggested, relevance to the current focus of attention in the dialogue and similarity to the information‐seeker's actual utterance are used to select the interpretation that is most likely to represent his intended

ISSN:0824-7935    

DOI:10.1111/j.1467-8640.1987.tb00180.x

出版商:Blackwell Publishing Ltd    

年代:1987

数据来源: WILEY

摘要:

This article introduces the notion ofCAS‐equivalentlogic programs: logic programs with identical correct answer substitutions. It is shown that the notions CAS‐equivalence, refutational equivalence, and logical equivalence do not coincide in the case of definite clause logic programs. Least model criteria for refutational and CAS‐equivalence are suggested and their correctness is proved. The least model approach is illustrated by two proofs of CAS‐equivalence. It is shown that the symmetric extension of a logic program subsumes the symmetry axiom and the symmetric homogeneous form of a logic program with equality subsumes the symmetry, transitivity, and predicate substitutivity axioms of equality. These results contribute towards the goal of building equality into standard Prolog without introducing additional inferenc

ISSN:0824-7935    

DOI:10.1111/j.1467-8640.1987.tb00181.x

出版商:Blackwell Publishing Ltd    

年代:1987

数据来源: WILEY

ISSN:0824-7935    

DOI:10.1111/j.1467-8640.1987.tb00182.x

出版商:Blackwell Publishing Ltd    

年代:1987

数据来源: WILEY

ISSN:0824-7935    

DOI:10.1111/j.1467-8640.1987.tb00183.x

出版商:Blackwell Publishing Ltd    

年代:1987

数据来源: WILEY

ISSN:0824-7935    

DOI:10.1111/j.1467-8640.1987.tb00184.x

出版商:Blackwell Publishing Ltd    

年代:1987

数据来源: WILEY

ISSN:0824-7935    

DOI:10.1111/j.1467-8640.1987.tb00185.x

出版商:Blackwell Publishing Ltd    

年代:1987

数据来源: WILEY

ISSN:0824-7935    

DOI:10.1111/j.1467-8640.1987.tb00186.x

出版商:Blackwell Publishing Ltd    

年代:1987

数据来源: WILEY

ISSN:0824-7935    

DOI:10.1111/j.1467-8640.1987.tb00187.x

出版商:Blackwell Publishing Ltd    

年代:1987

数据来源: WILEY

ISSN:0824-7935    

DOI:10.1111/j.1467-8640.1987.tb00188.x

出版商:Blackwell Publishing Ltd    

年代:1987

数据来源: WILEY