Scribd
Upload
4 views

Assignment 1

Uploaded by

akram bennani
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Assignment 1

Uploaded by

akram bennani
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Foundations of Discrete Mathematics - Assignment 1

Abdelqoddous Moussa
Due Date: Sunday before 10 PM

Problem 1: Automated Theorem Proving Using the Res-


olution Rule
Background
In propositional logic, statements can be expressed in various forms. One such form is the
Conjunctive Normal Form (CNF), which is a conjunction of one or more clauses, where
each clause is a disjunction of literals. A literal is either a variable or its negation. For example,
the expression (A ∨ ¬B) ∧ (C ∨ D) is in CNF.
The resolution rule is a fundamental inference rule used in automated theorem proving. It
allows the derivation of new clauses by eliminating complementary literals from pairs of clauses.
By systematically applying the resolution rule, one can determine the satisfiability of a set of
clauses or derive a contradiction if the set is unsatisfiable.

Problem Statement
You are provided with the following set of statements expressed in Conjunctive Normal Form:

1. Statement 1: Not A or B

2. Statement 2: A or Not C

3. Statement 3: Not B or C

4. Statement 4: Not C or D

5. Statement 5: Not D

Your task is to determine whether these statements are satisfiable, meaning there exists
an assignment of truth values to the variables A, B, C, and D that makes all statements true
simultaneously. If the set is unsatisfiable, use the resolution rule to derive an empty clause,
thereby proving a contradiction.

Tasks
1. Apply the Resolution Rule:

• Identify pairs of statements that can be resolved based on complementary literals (a


literal and its negation).

1
• Perform the resolution step-by-step to derive new statements.

2. Derive the Empty Clause:

• Continue applying the resolution rule until you derive an empty clause, indicating
that the original set of statements is unsatisfiable.

3. Explanation:

• For each resolution step, provide a clear explanation of which statements are being
resolved and the rationale behind each resolution.
• Summarize your conclusion regarding the satisfiability of the original set of state-
ments.

Problem 2: Logic-Based Verification of a Simple Access


Control System Using Resolution
Background
Access control systems are essential in computer security, determining who is authorized to ac-
cess specific resources within a system. These systems operate based on a set of rules and policies
that define the permissions granted to different users. Modeling these rules using propositional
logic allows for rigorous verification to ensure consistency and prevent unauthorized access.

Problem Statement
Consider a simplified access control system with the following components:

• Users: Alice, Bob, and Carol

• Resources: File1, File2, and File3

• Permissions: Read, Write, and Execute

The access control rules are defined as follows:

1. Rule 1: If a user is Alice or Bob, they can read File1.

2. Rule 2: If a user is Bob, they can write File2.

3. Rule 3: If a user can write File2, they can execute File3.

4. Rule 4: Carol can execute File1.

5. Constraint: No user can write File3.

2
Tasks
1. Convert Rules to Conjunctive Normal Form (CNF):

• Translate all the given rules into Conjunctive Normal Form to prepare them for
applying the resolution rule.

2. Verify Access Permissions:

• a. Determine whether Bob can execute File3 by applying the resolution rule to the
CNF-translated rules.
• b. Determine whether Carol can write File1.

3. Check Policy Consistency:

• Use the resolution rule to verify that the set of access control rules and constraints
does not contain any contradictions, ensuring the policy is consistent.

4. Identify Potential Conflicts:

• Analyze the interaction between the rules to identify any potential conflicts or un-
intended permissions. Use the resolution rule to support your findings.

Good luck!

You might also like