J-L. Lassez, K. Marriott, "Explicit representation of terms defined by counter examples". Journal of Automated Reasoning 3, pp 301-317, 1987. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
On Deciding Subsumption Problems - Egly, Pichler, Woltran (2003) (1 citation) (Correct)
On Inductive Inference of Cyclic Structures - Maher, Stuckey (2000) (1 citation) (Correct)
A Logic Programming View of CLP - Maher (1993) (49 citations) (Correct)
Constructive Negation Under The Well-Founded Semantics - Julie Yuchih Liu (1996) (5 citations) (Correct)
Negation and Constraint Logic Programming - Stuckey (1995) (4 citations) (Correct)
Constraint Logic Programming: A Survey - Jaffar, Maher (1994) (359 citations) (Correct)
Higher-Order Pattern Complement and Strict Lambda-Calculus - Alberto Momigliano.. (1999) (Correct)
Speed-up Transformations of Logic Programs by Abstraction and.. - Eusterbrock (Correct)
The Relative Complement Problem for Higher-Order Patterns - Momigliano, Pfenning (1999) (Correct)
A Procedural Semantics for Well Founded Negation in Logic Programs - Ross (1989) (53 citations) (Correct)
Decidability of Sort Checking in Softly Sorted Languages - Jian Chen (1994) (Correct)
Disunification: a Survey - Comon (1991) (35 citations) (Correct)
Open Problems in Rewriting - Dershowitz, Jouannaud, Klop (1991) (19 citations) (Correct)
Regular Search Spaces and Constructive Negation - Momigliano, Ornaghi (1997) (Correct)
Learning Logical Exceptions In Chess - Bain (1994) (7 citations) (Correct)
More Problems in Rewriting - Dershowitz, Jouannaud, Klop (1993) (25 citations) (Correct)
The Relative Complement Problem for Higher-Order Patterns - Momigliano, Pfenning (1999) (Correct)
On Sets of Terms: A Study of a Generalisation Relation.. - Higuera, Daniel-Vatonne (1996) (Correct)
On the Word, Subsumption, and Complement Problem for.. - Hermann, Salzer (Correct)
An Almost Perfect Abstraction Operator for Partial Deduction - Leuschel, De Schreye (1994) (4 citations) (Correct)
A Polynomial Time Algorithm for Finding Finite Unions.. - Arimura, Shinohara.. (1993) (Correct)
Generalization and Learnability: A Study of Constrained Atoms - Page, Jr., Frisch (1992) (38 citations) (Correct)
On Sets of Terms: - Study Of Generalisation (Correct)
Non-failure Analysis and Granularity Control in Parallel.. - Garcia (2000) (Correct)
A Generalization of the Least General Generalization - Arimura, Shinohara, Otsuki (1994) (1 citation) (Correct)
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