Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
Look up keyword or section
Like this

Table Of Contents

1.1 Purpose
1.2 Logic Programming and Language
1.3 Programming In Prolog
1.4 Overview
1.5 Bibliographic Notes
2.1 Databases and Queries
2.1.1 A Simple Database
2.3 The Logic of Prolog
2.4 The Operation of Database Prolog
2.4.1 Proof Trees and Traces
2.5 Recursive Predicate Definitions
2.5.1 Variable Renaming
2.5.2 Termination
2.6 Problem Section: Semantic Networks
2.7 Context-Free Grammars
2.7.1 Axiomatizing Context-Free Grammars
2.7.2 Context-Free Grammars in Prolog
2.7.3 Prolog as Parser
2.8 Problem Section: Grammars
2.8.1 A Syntactic Analyzer for Database Prolog
2.8.2 Extending CFGs with Intersection
2.8.3 Transition Networks
2.9 Bibliographic Notes
3.1 Prolog Notation Revisited
3.2 Terms and Unification
3.3 Functions in Prolog and Other Languages
3.3.1 Alternate Notations for Functors
3.4 Lists
3.4.1 List Processing
3.4.2 Representing String Positions with Lists
3.5 The Logic and Operation of Prolog Revisited
3.5.1 Substitutions
3.5.2 Unification
3.5.3 Resolution
3.5.4 Prolog’s proof procedure
3.5.5 Semantics of Prolog
3.6 Problem Section: Terms and Lists
3.7 Definite Clause Grammars
3.7.1 Trees for Simple Sentences
3.7.2 Embedding Prolog Calls in DCGs
3.8.2 Extending Syntactic Coverage
3.9 Bibliographic Notes
Further Topics in Natural-Language Analysis
4.1 Semantic Interpretation
4.1.1 The Lambda Calculus
4.1.2 A Simple Compositional Semantics
4.1.3 Encoding the Semantic System in Prolog
4.1.4 Partial Execution
4.1.5 Quantified Noun Phrases
4.1.6 Quantifier Scope
4.2.1 Auxiliary Verbs
4.2.2 Yes-No Questions
4.2.3 Filler-Gap Dependencies
4.2.4 Relative Clauses
4.2.5 WH-Questions
4.2.6 Semantics of Filler-Gap Dependencies
4.2.7 Gap Threading
4.3 Problem Section: Grammar Extensions
4.3.1 Noun Complements
4.3.2 Noun Postmodifiers
4.3.3 More Filler-Gap Constructions
4.3.4 Categorial Grammars
4.4 Bibliographic Notes
5.1 Metalogical Facilities
5.1.1 The call predicate
5.1.2 The cut command
5.1.3 The Negation-as-Failure Operator
5.1.4 The setof predicate
5.1.5 The assert command
5.1.6 Other Extralogical Predicates
5.2 A Simple Dialogue Program
5.2.1 Overall Operation
5.2.2 Parsing
5.2.3 LF Conversion
5.2.4 Constructing A Reply
5.3 User Interaction
5.3.1 Simple Input/Output Commands
5.3.2 A Simple User Interface
5.4 Bibliographic Notes
6.1 Prolog in Prolog
6.1.1 Absorption
6.1.2 Keeping Proof Trees
6.1.3 Unit Clauses
6.2 Problem Section: Prolog Interpreters
6.2.1 Consecutively Bounded Depth-First Search
6.2.2 An Interpreter For Cut
6.3 Interpreters for DCGs
6.3.1 DCG in Prolog
6.3.2 DCG in DCG
6.3.3 An Interpreter for Filler-Gap DCGs
6.4 Partial Execution and Compilers
6.4.1 Partial Execution Revisited
6.4.2 Compiling by Partial Execution
6.4.3 Generality of the Method
6.5 Bottom-Up Parsing
6.5.1 Linking
6.5.2 Compiling DCGs into Left-Corner Parsers
6.6 Tabular Parsing
6.6.1 Inefficiencies of Backtracking
6.6.2 Tabular Parsing in the Abstract
6.6.3 Top-Down Tabular Parsing
6.6.4 Subsumption
6.6.5 The Top-Down Tabular Parser in Action
6.6.6 General Tabular Parsing
6.6.7 Earley Deduction and Earley’s CF Parsing Algorithm
6.6.8 Limitations of Tabular Parsers
6.7. Problem Section: DCG Interpreters and Compilers
6.7 Problem Section: DCG Interpreters and Compilers
6.8 Bibliographic Notes
Listing of Sample Programs
A.1 A Note on Programming Style
A.2 The TALK Program
A.3 The DCG Compiler
0 of .
Results for:
No results containing your search query
P. 1
Prolog Digital

Prolog Digital

Ratings: (0)|Views: 2|Likes:
Published by L Srinivasa Rao

More info:

Published by: L Srinivasa Rao on Dec 05, 2010
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 5 to 17 are not shown in this preview.
You're Reading a Free Preview
Pages 22 to 30 are not shown in this preview.
You're Reading a Free Preview
Pages 35 to 69 are not shown in this preview.
You're Reading a Free Preview
Pages 74 to 96 are not shown in this preview.
You're Reading a Free Preview
Pages 101 to 204 are not shown in this preview.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->