1. Home
  2. /
  3. Prolog Typing Test
  4. /
  5. Resettable Counter

Resettable Counter - Prolog Typing CST Test

Skip to main content
CodeSpeedTest
Languages
Start TypingJump into a test — pick any languageAdaptive TrainingUnlock chars as you master themPractice DrillsFocused sessions targeting weak spotsDaily ChallengesNew coding challenges every dayRace ModeCompete against others in real timeAI OpponentRace against an AI at your WPM levelTournamentsLive coding speed tournamentsArcade GamesZType, Overkill Survival, Glyphica & moreGamificationXP, coins, badges & quests
LeaderboardGlobal rankings for every languageCertificatesEarn verifiable Bronze / Silver / Gold certsActivityDaily streaks & historical analyticsProfileYour stats, badges & achievements
Browse Languages500+ languages with real code examplesBlogTips, guides & deep divesFree ToolsWPM calculator, typing speed report & moreFAQCommon questions answeredGetting StartedNew to CodeSpeedTest?AboutOur story & missionSupportGet help — Pro users get priorityContactGet in touch with the team
Pricing
Mode:
Duration:
1
2
3
4
5
6
7
:- dynamic(count/1).
count(0).
increment :- count(C), C1 is C + 1, retract(count(C)), assert(count(C1)).
reset :- retract(count(_)), assert(count(0)).

% Example
?- increment, increment, count(C), write(C), nl, reset, count(C2), write(C2), nl.
Coding works best on desktop or with an external keyboard.
CodeSpeedTest

Improve your coding speed, code accuracy, and programming syntax WPM with practice sessions across 500+ programming languages.

Quick Links

HomeAboutFeaturesGetting StartedLanguages

Legal & Support

Pro ⚡ PricingContactPrivacy PolicyTerms of Service

Connect

CodeSpeedTest on GitHubCodeSpeedTest on TwitterEmail CodeSpeedTest

© 2026 CodeSpeedTest. All rights reserved.

Resettable Counter — Prolog Code

Counter that can increment and reset.

:- dynamic(count/1).
count(0).
increment :- count(C), C1 is C + 1, retract(count(C)), assert(count(C1)).
reset :- retract(count(_)), assert(count(0)).

% Example
?- increment, increment, count(C), write(C), nl, reset, count(C2), write(C2), nl.

Prolog Language Guide

Prolog (Programming in Logic) is a high-level, declarative programming language focused on logic programming and symbolic reasoning. It is widely used in artificial intelligence, natural language processing, and rule-based systems, enabling developers to express knowledge and relationships rather than step-by-step instructions.

Primary Use Cases

  • ▸Expert systems and rule-based AI
  • ▸Natural language processing
  • ▸Automated theorem proving
  • ▸Knowledge representation and reasoning
  • ▸Constraint logic programming

Notable Features

  • ▸Declarative syntax: describe what to solve, not how
  • ▸Built-in backtracking search
  • ▸Unification for pattern matching
  • ▸Logical inference engine
  • ▸Support for recursion and symbolic computation

Origin & Creator

Developed in 1972 by Alain Colmerauer and Robert Kowalski at the University of Marseille.

Industrial Note

Prolog underpins many AI applications, including expert systems, natural language understanding, and theorem proving frameworks.

Quick Explain

  • ▸Prolog uses facts, rules, and queries to express logical relationships.
  • ▸It relies on a built-in inference engine to solve queries automatically.
  • ▸Ideal for AI, expert systems, and symbolic computation tasks.

Core Features

  • ▸Facts, rules, and queries
  • ▸Horn clauses for logical statements
  • ▸Recursion for complex relationships
  • ▸Pattern matching via unification
  • ▸Backtracking for automatic solution search

Learning Path

  • ▸Learn syntax of facts, rules, and queries
  • ▸Practice recursion and list handling
  • ▸Build small logic puzzles
  • ▸Explore constraint logic programming
  • ▸Develop AI or expert system prototypes

Practical Examples

  • ▸Family tree reasoning (parent/ancestor relationships)
  • ▸Simple expert system for medical diagnosis
  • ▸Natural language sentence parsing
  • ▸Sudoku solver using constraints
  • ▸Graph pathfinding and logic puzzles

Comparisons

  • ▸More declarative than imperative languages like Python or Java
  • ▸Stronger logic inference than traditional SQL
  • ▸Better for symbolic reasoning than C/C++
  • ▸Less performant for numerical or low-level tasks
  • ▸Specialized for AI and logic-based applications

Strengths

  • ▸Concise expression of complex logic
  • ▸Ideal for symbolic reasoning
  • ▸Automatic search and inference
  • ▸Supports rapid prototyping of AI systems
  • ▸Good for teaching logic programming concepts

Limitations

  • ▸Not ideal for numerical computation or low-level tasks
  • ▸Performance can degrade on large datasets
  • ▸Less mainstream than procedural or object-oriented languages
  • ▸Debugging can be challenging due to implicit control flow
  • ▸Limited standard library for modern applications

When NOT to Use

  • ▸High-performance numerical computing
  • ▸Systems programming or OS development
  • ▸Large-scale transactional applications
  • ▸GUI-heavy applications
  • ▸General-purpose scripting outside AI/reasoning domains

Cheat Sheet

  • ▸fact(example).
  • ▸rule(X) :- condition1(X), condition2(X).
  • ▸?- query(X).
  • ▸Lists: [Head
  • ▸Trace execution with trace/0

FAQ

  • ▸Is Prolog still used?
  • ▸Yes - mainly in AI, NLP, and academic research.
  • ▸Is Prolog declarative or imperative?
  • ▸Declarative - you specify what is true, not how to compute it.
  • ▸Can Prolog solve puzzles?
  • ▸Absolutely - it excels at logic puzzles and constraints.
  • ▸Should I learn Prolog for AI?
  • ▸Yes, for symbolic reasoning and expert systems.

30-Day Skill Plan

  • ▸Week 1: Facts, rules, and queries
  • ▸Week 2: Recursion and list operations
  • ▸Week 3: Constraint logic programming
  • ▸Week 4: Build small AI/expert system projects

Final Summary

  • ▸Prolog is a declarative logic programming language for AI and symbolic computation.
  • ▸Uses facts, rules, and queries with automatic inference and backtracking.
  • ▸Ideal for knowledge-based systems, NLP, and constraint-solving.
  • ▸Key skill for AI researchers and logic programming practitioners.

Project Structure

  • ▸src/ - Prolog knowledge base files
  • ▸tests/ - queries for verification
  • ▸modules/ - reusable Prolog modules
  • ▸examples/ - sample AI applications
  • ▸docs/ - documentation of rules/facts

Monetization

  • ▸AI consulting using Prolog
  • ▸Expert systems development
  • ▸Constraint solving services
  • ▸Educational tools and training
  • ▸Research in logic programming and AI

Productivity Tips

  • ▸Use modules for organization
  • ▸Leverage built-in libraries for lists, constraints, NLP
  • ▸Trace execution for debugging
  • ▸Test queries incrementally
  • ▸Document predicates for collaboration

Basic Concepts

  • ▸Facts: basic knowledge statements
  • ▸Rules: conditional logic statements
  • ▸Queries: questions posed to the knowledge base
  • ▸Variables: placeholders in patterns
  • ▸Recursion and list processing

Official Docs

  • ▸SWI-Prolog Reference Manual
  • ▸ISO Prolog Standard
  • ▸GNU Prolog Documentation

More Prolog Typing Exercises

Prolog Counter SimulationProlog Simple AdditionProlog FactorialProlog Fibonacci SequenceProlog Max of Two NumbersProlog List SumProlog Even Numbers FilterProlog Conditional Counter IncrementProlog Theme Toggle Only

Practice Other Languages

CReactPythonC++RustTypeScriptKotlinPHPJavaC#RubyMqlCqlN1qlCypher