Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-inductive-inference-of-cyclic-structures-c40jeFhwvq
References (34)
-
Taisuke Sato, H. Tamaki (1984)
Transformational Logic Program Synthesis -
J. Shoenfield (1967)
Mathematical logic -
E. Eder (1983)
Properties of Substitutions and UnificationsJ. Symb. Comput., 1
-
Tom Mitchell (1977)
Version Spaces: A Candidate Elimination Approach to Rule Learning -
K.L. Clark (1978)
Logic and Databases -
Hubert Comon-Lundh (1988)
Unification et disunification : théorie et applications -
R. Young, G. Plotkin, R. Linz (1977)
Analysis of an Extended Concept-Learning Task -
J. Jaffar, J. Lassez, Michael Maher (1987)
PROLOG - II as an instance of the logic programming language scheme -
A. Colmerauer (1982)
Logic Programming -
G. Huet (1977)
Conflunt reductions: Abstract properties and applications to term rewriting systems18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
-
B. Courcelle (1983)
Fundamental Properties of Infinite TreesTheor. Comput. Sci., 25
-
D. Chan (1988)
Constructive Negation Based on the Completed Database -
C. Mellish (1991)
The Description Identification ProblemArtif. Intell., 52
-
J. Jaffar, J. Lassez (1987)
Constraint logic programming -
J. Jaffar, Peter Stuckey (1986)
Semantics of Infinite Tree Logic ProgrammingTheor. Comput. Sci., 46
-
M. Wallace (1987)
Negation by Constraints: A Sound and Efficient Implementation of Negation in Deductive Databases -
Hubert Comon-Lundh, P. Lescanne (1989)
Equational Problems and DisunificationJ. Symb. Comput., 7
-
A. Colmerauer (1984)
Equations and Inequations on Finite and Infinite Trees -
J. Lassez, Michael Maher, K. Marriott (1986)
Unification Revisited -
G. Kuper, K. McAloon, K. Palem, K. Perry (1988)
Efficient parallel algorithms for anti-unification and relative complement[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
-
K. Kunen (1987)
Negation in Logic ProgrammingJ. Log. Program., 4
-
Peter Stuckey (1991)
Constructive negation for constraint logic programming[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
-
Michael Maher (1991)
Representing Sets of Rational Trees Using Techniques of Non-Monotonic Reasoning -
Michael Maher (1988)
Complete axiomatizations of the algebras of finite, rational and infinite trees[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
-
K. Kunen (1987)
Answer Sets and Negation-as-Failure -
J. Maluszynski, T. Näslund (1989)
Fail Substitutions for Negation as Failure -
B. Courcelle (1986)
Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and GrammarsTheor. Comput. Sci., 42
-
Tom Mitchell (1982)
Generalization as SearchArtif. Intell., 18
-
J. Lloyd (1984)
Foundations of Logic Programming -
J. Lassez, Michael Maher, K. Marriott (1991)
Elimination of Negation in Term Algebras -
Michael Maher (1987)
Logic Semantics for a Class of Committed-Choice Programs -
Keith Clark (1987)
Negation as Failure -
J. Lassez, K. Marriott (1986)
Explicit representation of terms defined by counter examplesJournal of Automated Reasoning, 3
-
G. Huet (1980)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM (JACM), 27
- Publisher
- Springer Journals
- Copyright
- Copyright
- Subject
- Computer Science; Artificial Intelligence; Mathematics, general; Computer Science, general; Complex Systems
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1007/BF01534454
- Publisher site
- See Article on Publisher Site
Abstract
We examine the problem of inductive inference in the domain of pointer-based data structures. We show how these data structures can be formalized as rational trees. Our main technical results concern the expressiveness of a language of rational term expressions. These results place limitations on techniques of inductive inference for this description language. The results are also relevant to implementation of negation in logic programming languages.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Apr 5, 2005