On inductive inference of cyclic structures

Michael J. Maher; Peter J. Stuckey

doi:10.1007/BF01534454

On inductive inference of cyclic structures

Michael J. Maher, Peter J. Stuckey

Research output: Contribution to journal › Article › Research › peer-review

7 Citations (Scopus)

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.

Original language	English
Pages (from-to)	167-208
Number of pages	42
Journal	Annals of Mathematics and Artificial Intelligence
Volume	15
Issue number	2
DOIs	https://doi.org/10.1007/BF01534454
Publication status	Published - 1 Jun 1995
Externally published	Yes

Access to Document

10.1007/BF01534454

Cite this

@article{ecabacf497c140f493e2f35fee29b501,

title = "On inductive inference of cyclic structures",

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.",

author = "Maher, {Michael J.} and Stuckey, {Peter J.}",

year = "1995",

month = jun,

day = "1",

doi = "10.1007/BF01534454",

language = "English",

volume = "15",

pages = "167--208",

journal = "Annals of Mathematics and Artificial Intelligence",

issn = "1012-2443",

publisher = "Springer-Verlag London Ltd.",

number = "2",

}

TY - JOUR

T1 - On inductive inference of cyclic structures

AU - Maher, Michael J.

AU - Stuckey, Peter J.

PY - 1995/6/1

Y1 - 1995/6/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=21844490750&partnerID=8YFLogxK

U2 - 10.1007/BF01534454

DO - 10.1007/BF01534454

M3 - Article

AN - SCOPUS:21844490750

SN - 1012-2443

VL - 15

SP - 167

EP - 208

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

IS - 2

ER -

On inductive inference of cyclic structures

Abstract

Access to Document

Other files and links

Cite this