Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Computer Programming for Absolute Beginners

You're reading from   Computer Programming for Absolute Beginners Learn essential computer science concepts and coding techniques to kick-start your programming career

Arrow left icon
Product type Paperback
Published in Jul 2020
Publisher Packt
ISBN-13 9781839216862
Length 430 pages
Edition 1st Edition
Arrow right icon
Author (1):
Arrow left icon
Joakim Wassberg Joakim Wassberg
Author Profile Icon Joakim Wassberg
Joakim Wassberg
Arrow right icon
View More author details
Toc

Table of Contents (19) Chapters Close

Preface 1. Section 1: Introduction to Computer Programs and Computer Programming
2. Chapter 1: Introduction to Computer Programs FREE CHAPTER 3. Chapter 2: Introduction to Programming Languages 4. Chapter 3: Types of Applications 5. Chapter 4: Software Projects and How We Organize Our Code 6. Section 2: Constructs of a Programming Language
7. Chapter 5: Sequence – The Basic Building Block of a Computer Program 8. Chapter 6: Working with Data – Variables 9. Chapter 7: Program Control Structures 10. Chapter 8: Understanding Functions 11. Chapter 9: When Things Go Wrong – Bugs and Exceptions 12. Chapter 10: Programming Paradigms 13. Chapter 11: Programming Tools and Methodologies 14. Section 3: Best Practices for Writing High-Quality Code
15. Chapter 12: Code Quality 16. Other Books You May Enjoy Appendix A: How to Translate the Pseudocode into Real Code 1. Appendix B: Dictionary

Understanding logic programming

This paradigm is based on formal logic. A program written in a language that implements this paradigm is constructed of a set of sentences in a logical form that will express facts and rules about a specific problem domain.

This might sound complicated and strange, but as we will see, the basic concepts of this paradigm are rather simple. Consider the following diagram:

Figure 10.20 – A family tree

In the preceding diagram, we can see a family tree. Looking at it, we can see the following:

  • Anna and Bob have a child, Lisa.
  • Lisa and Fred have a child, Karen.
  • Fred and Sue have a child, John.
  • Karen's grandparents are Anna and Bob.

In a programming language that uses logic programming, we can define this family tree using something called predicates. This will look something like this:

mother(anna,lisa).
mother(lisa,karen).
mother(sue,john).
father(bob,lisa).
father(fred,karen).
father...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image