Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Some classes of Prolog programs inferable from positive data

From MaRDI portal
Publication:1575466
Jump to:navigation, search

DOI10.1016/S0304-3975(99)00271-6zbMath0944.68015MaRDI QIDQ1575466

M. R. K. Krishna Rao

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

inferability of Prolog programs


Mathematics Subject Classification ID

Logic programming (68N17)


Related Items (2)

Some classes of term rewriting systems inferable from positive data ⋮ Developments from enquiries into the learnability of the pattern languages from positive data



Cites Work

  • Inductive inference of monotonic formal systems from positive data
  • Termination proofs for logic programs
  • Reasoning about termination of pure Prolog programs
  • A class of prolog programs inferable from positive data
  • Inductive inference of formal languages from positive data
  • Toward a mathematical theory of inductive inference
  • Inductive Logic Programming: Theory and methods
  • Language identification in the limit
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Some classes of Prolog programs inferable from positive data

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1575466&oldid=13857808"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 01:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki