Learning hereditary and reductive prolog programs from entailment

Authors:
Shahid Hussain;M. R. K. Krishna Rao
Affiliations:
Computer Science & Engineering Department, Bahria University, Karachi, Pakistan;Information & Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia and Lakshami Enterprises (Aust) Pty Ltd and Balaji Real Estate Pty Ltd, Sunnybank, ...
Venue:
ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
Year:
2009

Citing 14
Cited 0

Foundations of logic programming

Foundations of logic programming
Learning with hints

COLT '88 Proceedings of the first annual workshop on Computational learning theory
Logic programming

Handbook of theoretical computer science (vol. B)
The art of Prolog (2nd ed.): advanced programming techniques

The art of Prolog (2nd ed.): advanced programming techniques
Some classes of Prolog programs inferable from positive data

Theoretical Computer Science - Special issue on algorithmic learning theory
Polynomial-time learnability of logic programs with local variables from entailment

Theoretical Computer Science - Algorithmic learning theory
Algorithmic Program DeBugging

Algorithmic Program DeBugging
Learning closed horn expressions

Information and Computation
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Learning Linearly-Moded Programs from Entailment

PRICAI '98 Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
Learning Acyclic First-Order Horn Sentences from Entailment

ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Learning First-Order Acyclic Horn Programs from Entailment

ILP '98 Proceedings of the 8th International Workshop on Inductive Logic Programming
Learnability Results for Elementary Formal Systems: EFS and Prolog programs

Learnability Results for Elementary Formal Systems: EFS and Prolog programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study exact learning of Prolog programs from entailment and present an algorithm to learn two rich classes of Prolog programs namely hereditary and reductive Prolog programs. These classes contain standard Prolog programs with and without recursion like append, merge, split, delete, member, prefix, suffix, length, add, etc. Additionally our algorithm learns the hereditary Prolog programs in polynomial time.