P.T. Cox, E.Knill, and T. Pietrzykowski. Abduction in Logic Programming with Equality. In Proc. of International Conference on Fifth Generation Computer Systems, pages 539--545, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Duality of Abduction and Model Generation in a.. - Denecker, De Schreye (1994) (5 citations) (Correct)
....are solved by our prototype planner. Finally, we want to draw attention to an unexpected application of the duality framework. An uncommon form of abduction is obtained if FEQ is replaced by general equality EQ and the equality predicate is abducible. This form of abduction is presented in [5]. Take the program P = fr(a) g. For this program, the query r(b) has a successful abductive derivation. r(b) Delta = fg 2 Delta = fb = ag r(b) succeeds under the abductive hypothesis fb = ag. The duality framework provides the technical support for efficiently implementing this form of ....
P.T. Cox, E.Knill, and T. Pietrzykowski. Abduction in Logic Programming with Equality. In Proc. of International Conference on Fifth Generation Computer Systems, pages 539--545, 1992.
Completing Fault Models for Abductive Diagnosis - Knill (1996) Self-citation (Cox Knill Pietrzykowski) (Correct)
....behavior of a device by binding the extra parameters to the appropriate values. To avoid relatively trivial explanations, each device s behaviorial mode is identified in the diagnosis. The second idea, the instantiation method, is a dramaticallly simplyfied version of the technique described in [Cox et al. 1992b] Instead of adding parameters to the behavioral mode predicates, the notion of an abductive diagnosis is extended to allow certain identities involving local device functions (e.g. inputs and outputs) The exact behavior of devices can then be described by specifying it directly. As for the ....
....together with SD and C implies O. A strong abductive diagnosis satisfies D 0 = D. E is also called an explanation of O. Minimal conjunctions of abducibles are preferred as explanations. More generally, if E and E 0 are explanations where E implies E 0 , then E 0 is preferred by parsimony [Cox et al. 1992a] In addition, explanations with a minimal set of fault assumptions are preferred. Both for consistency based and abductive diagnosis, it is desirable to use stronger preference measures depending on the application. The notion of implication and consistency in the above definitions can depend ....
[Article contains additional citation context not shown here]
P.T. Cox, E. Knill, T. Pietrzykowski, Abduction in logic programming with equality, Proceedings of the International Conference on Fifth Generation Computer Systems 1992, 539--545.
Equality and Abductive Residua for Horn Clauses - Knill, Cox, Pietrzykowski (1992) (4 citations) Self-citation (Cox Knill Pietrzykowski) (Correct)
....a : f(x) m : p(a) To apply surface deduction, the theory and the negation of the observation are first transformed to flat, separated and symmetrized form. For simplicity, separation and symmetrization are omitted here. See Section 3 for a discussion of the full transformation and [10] for a detailed example of an abduction which requires these transformations. The flat form of the theory is obtained by a few applications of replacement axioms. S(f(x) L(x) transforms to S(y) L(x) y : f(x) p(x) p(f(x) L(x) transforms to y : p(z) L(x) y : p(x) z : ....
P.T. Cox, E. Knill and T. Pietrzykowski, Abduction in logic programming with equality, in: Proceedings of the International Conference on Fifth Generation Computer Systems Tokyo, Japan, 1992, 539--545.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC