Scribd
Upload
10 views9 pages

Horn Clauses Logic Procedures

Horn clauses are a specific type of logical clause with at most one positive literal, crucial for logic programming and automated reasoning. Key procedures include forward and backward chaining for inference, as well as resolution-based proof techniques. Their applications extend to AI, theorem proving, and database systems.

Uploaded by

Mary ann Mora
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
10 views9 pages

Horn Clauses Logic Procedures

Horn clauses are a specific type of logical clause with at most one positive literal, crucial for logic programming and automated reasoning. Key procedures include forward and backward chaining for inference, as well as resolution-based proof techniques. Their applications extend to AI, theorem proving, and database systems.

Uploaded by

Mary ann Mora
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

HORN CLAUSES & LOGIC

PROCEDURES

GRACE CLOSA
JOMARI FLORES
JOHN PAUL PADIGOS
BLADIMER VILLONES
HORN CLAUSES & LOGIC
PROCEDURES
Introduction
• Horn Clause: A special form of clause in propositional or
first-order logic.
• Applications: Basis for logic programming languages like
Prolog.
WHAT ARE HORN CLAUSES?

•Definition: A Horn clause is a disjunction of literals with at most one positive literal.
•Examples:
•Positive clause: P
•Negative clause: \neg P \lor \neg Q
•Mixed clause: \neg P \lor Q
•Characteristics:
•Efficient for computation.
•Useful in automated reasoning.
TYPES OF HORN CLAUSES

1.Definite Clauses:
•Exactly one positive literal.
•Example: P \leftarrow Q, R (equivalent to \neg Q \lor \neg R \lor P).
2.Goal Clauses:
•No positive literals (also called empty head).
•Example: \leftarrow Q, R (equivalent to \neg Q \lor \neg R).
3.Fact:
•A single positive literal.
•Example: P.
LOGIC PROCEDURES
Forward Chaining
•
:
Process

•Start with known facts.


•Apply inference rules to derive new facts until the goal is reached.
•Example:
•Rules: A \rightarrow B, B \rightarrow C
•Facts: A
•Derive: C.
Backward Chaining
•
:
Process

•Start with the goal.


•Work backward to find supporting facts.
•Example:
•Goal: C
•Rules: A \rightarrow B, B \rightarrow C
•Verify: A.
RESOLUTION & PROOF PROCEDURES

Resolution Principle
•
: A rule of inference leading to refutation proofs.
Definition

•Steps:
1.Convert statements to Conjunctive Normal Form (CNF).
2.Apply the resolution rule repeatedly.
3.Derive a contradiction (empty clause).
•Example:
•Statements: (P \lor Q), (\neg P \lor R)
•Resolvent: Q \lor R.
PROOF PROCEDURES

• Resolution-Based Proof

1. Input: A set of clauses and a goal.


2. Process:
1. Combine clauses to derive new information.
2. Stop when an empty clause is derived or no more resolutions are possible.
3. Output: Success (proof found) or failure.
• Refutation Proof

• Goal: Prove a statement by assuming its negation and deriving a contradiction.

• Steps:
• Negate the statement to be proven.
• Add it to the knowledge base.
• Apply resolution to derive an empty clause.
APPLICATION

1.Logic Programming: Basis for languages like Prolog.


2.Automated Theorem Proving: Verifying mathematical
theorems.
3.AI and Expert Systems: Rule-based reasoning.
4.Database Systems: Query optimization and logic
inference.
SUMMARY

• Horn clauses simplify logical reasoning and enable efficient


computation.
• Resolution and proof procedures are essential for automated
reasoning and logic programming.
• Applications span AI, database systems, and formal
verification.

You might also like