npsai 1.0.0__tar.gz

npsai-1.0.0/Num/__init__.py

@@ -0,0 +1,77 @@
+"""AI assignment study reference. Usage: import Num as NPS; NPS.show()."""
+from importlib.resources import files
+from pathlib import Path
+import json
+import runpy
+
+__version__ = "1.0.0"
+_CATALOG = json.loads(files(__package__).joinpath("data/catalog.json").read_text())
+
+
+def show(assignment=None):
+    """List assignments, or display one assignment's questions and full source."""
+    if assignment is not None:
+        return _display(assignment)
+    print("AI lab assignments 2, 3, 4, 6, 8, 9")
+    for item in _CATALOG:
+        print(f"Assignment {item['number']} ({item['title']})")
+        print(f"  NPS.{item['function']}()")
+    print("Display: NPS.assignment2_agents() | Run: NPS.run(2) | Export: NPS.export(2)")
+
+
+def _validate(number):
+    if number not in [x["number"] for x in _CATALOG]:
+        raise ValueError("Choose assignment 2, 3, 4, 6, 8 or 9")
+    return number
+
+
+def question(number):
+    """Print the assignment question and source note."""
+    print(files(__package__).joinpath(f"data/assignment{_validate(number)}.txt").read_text())
+
+
+def code(number):
+    """Return full standalone Python source without executing it."""
+    return files(__package__).joinpath(f"solutions/assignment{_validate(number)}.py").read_text()
+
+
+def _display(number):
+    question(number)
+    print("FULL PYTHON CODE\n")
+    print(code(number))
+
+
+def run(number, **kwargs):
+    """Run the selected solution. Lab 8 accepts csv_path='/path/spam.csv'."""
+    number = _validate(number)
+    if number == 8:
+        from .solutions.assignment8 import main
+        return main(**kwargs)
+    if kwargs:
+        raise TypeError("Only assignment 8 accepts csv_path")
+    return runpy.run_module(f"Num.solutions.assignment{number}", run_name="__main__")
+
+
+def export(number, directory="."):
+    """Write full code and question to files, refusing to overwrite existing files."""
+    number = _validate(number)
+    folder = Path(directory)
+    folder.mkdir(parents=True, exist_ok=True)
+    targets = [folder / f"assignment{number}.py", folder / f"assignment{number}_question.txt"]
+    if any(path.exists() for path in targets):
+        raise FileExistsError("An export file already exists; use a different directory")
+    targets[0].write_text(code(number), encoding="utf-8")
+    targets[1].write_text(files(__package__).joinpath(f"data/assignment{number}.txt").read_text(), encoding="utf-8")
+    return tuple(str(path.resolve()) for path in targets)
+
+
+def _make_display(number, name):
+    def display():
+        return _display(number)
+    display.__name__ = name
+    display.__doc__ = f"Display all questions and full code for assignment {number}."
+    return display
+
+for _item in _CATALOG:
+    globals()[_item["function"]] = _make_display(_item["number"], _item["function"])
+    globals()[f"assignment{_item['number']}"] = globals()[_item["function"]]

npsai-1.0.0/Num/__main__.py

@@ -0,0 +1,17 @@
+from . import show, run
+import argparse
+
+def main():
+    parser = argparse.ArgumentParser(description="AI lab study package")
+    parser.add_argument("assignment", type=int, nargs="?")
+    parser.add_argument("--run", action="store_true")
+    args = parser.parse_args()
+    if args.run:
+        if args.assignment is None:
+            parser.error("--run requires an assignment number")
+        run(args.assignment)
+    else:
+        show(args.assignment)
+
+if __name__ == "__main__":
+    main()

npsai-1.0.0/Num/data/assignment2.txt

@@ -0,0 +1,7 @@
+Assignment 2 (Agents)
+
+QUESTION
+Implement a two-room Simple Reflex Vacuum Cleaner Agent. Show every state transition and stop when both rooms are clean. Convert it to a Model-Based Reflex Agent that remembers visited rooms, prints its memory, and chooses the next room using that memory. Also demonstrate the vending-machine reflex agent from the submitted notebook.
+
+SOURCE NOTE
+Task wording condensed from the Lab 2 document; the notebook additionally uses four rooms and a vending machine.

npsai-1.0.0/Num/data/assignment3.txt

@@ -0,0 +1,7 @@
+Assignment 3 (BFS and DFS)
+
+QUESTION
+Implement BFS and DFS to find a path from a start node to a goal node, and print their traversal orders. Use the submitted A-H graph with start A and goal H. Explain which algorithm guarantees the shortest path.
+
+SOURCE NOTE
+Condensed from the Lab 3 document and submitted code. BFS guarantees the fewest edges for an unweighted graph; DFS does not guarantee a shortest path.

npsai-1.0.0/Num/data/assignment4.txt

@@ -0,0 +1,7 @@
+Assignment 4 (Informed Search)
+
+QUESTION
+Implement Greedy Best First Search and A* for the submitted weighted A-Z graph and heuristics. Print the expansion order, actual start-to-goal path, and total path cost. Explain h(n) versus g(n)+h(n).
+
+SOURCE NOTE
+Condensed from the Lab 4 document and submitted notebook. The revised greedy code reconstructs the parent path rather than treating expansion order as a path.

npsai-1.0.0/Num/data/assignment6.txt

@@ -0,0 +1,472 @@
+Assignment 6 (Model Checking Algorithm)
+
+QUESTION
+Implement Sentence, Symbol, Not, And, Or, Implication, Biconditional and recursive model_check. Test operators, all six supplied inference cases, and an original three-proposition knowledge base. Explain why removing P from (P -> Q) AND (Q -> R) AND P changes entailment of R.
+
+SOURCE NOTE
+All 17 original notebook tasks are included below.
+
+To implement a Propositional Logic Inference System using the Model Checking algorithm in Python.
+
+## Learning Objectives
+
+After completing this experiment, students will be able to:
+
+1. Represent propositions using Python classes.
+2. Implement logical operators such as NOT, AND, OR, Implication and Biconditional.
+3. Represent a Knowledge Base (KB) and Query.
+4. Generate possible truth-value assignments called models.
+5. Implement Model Checking to determine logical entailment.
+
+## Problem Statement
+
+Develop a Python-based Propositional Logic Inference System that determines whether a given Query logically follows from a Knowledge Base using Model Checking.
+
+The system should support:
+
+- Atomic propositions
+- NOT
+- AND
+- OR
+- Implication
+- Biconditional
+- Model Checking
+
+Final Knowledge Base:
+
+(P → Q) ∧ (Q → R) ∧ P
+
+Query:
+
+R
+
+## Theory
+
+A proposition is a statement that can have either a True or False value.
+
+Examples:
+
+P = It is raining.
+
+Q = The road is wet.
+
+The following logical operators will be implemented:
+
+| Operator | Symbol | Meaning |
+|----------|--------|---------|
+| NOT | ¬P | Opposite of P |
+| AND | P ∧ Q | Both P and Q must be True |
+| OR | P ∨ Q | At least one must be True |
+| Implication | P → Q | If P is True, Q should be True |
+| Biconditional | P ↔ Q | P and Q have the same truth value |
+
+### Model Checking
+
+Model checking determines whether:
+
+KB ⊨ Query
+
+A Knowledge Base entails a Query if the Query is True in every possible model in which the Knowledge Base is True.
+
+# Task 1: Create the Base Sentence Class
+
+Create a base class named `Sentence`.
+
+The class should contain the following methods:
+
+1. `evaluate(model)`
+2. `formula()`
+3. `symbols()`
+
+### Requirements
+
+- `evaluate(model)` should evaluate a logical sentence.
+- `formula()` should return the logical formula as a string.
+- `symbols()` should return all symbols present in the sentence.
+
+### Student Task
+
+Complete the following class.
+
+# Task 2: Create the Symbol Class
+
+Create a class named `Symbol` that inherits from `Sentence`.
+
+For example:
+
+P = Symbol("P")
+
+The class should:
+
+1. Store the name of the symbol.
+2. Return its truth value from the given model.
+3. Return the symbol name as its formula.
+4. Return the symbol as a set.
+
+### Example Model
+
+model = {
+    "P": True
+}
+
+For the above model, evaluating P should return True.
+
+### Student Task
+
+Complete the following class.
+
+# Task 3: Implement NOT
+
+Implement the logical NOT operator.
+
+NOT P is represented as:
+
+¬P
+
+The NOT operation reverses the truth value.
+
+If:
+
+P = True
+
+then:
+
+¬P = False
+
+If:
+
+P = False
+
+then:
+
+¬P = True
+
+### Student Task
+
+Create the `Not` class by completing the code below.
+
+# Task 4: Implement AND
+
+Implement the logical AND operator.
+
+P ∧ Q is True only when both P and Q are True.
+
+Truth Table:
+
+| P | Q | P ∧ Q |
+|---|---|-------|
+| T | T | T |
+| T | F | F |
+| F | T | F |
+| F | F | F |
+
+### Student Task
+
+Create the `And` class.
+
+# Task 5: Implement OR
+
+Implement the logical OR operator.
+
+P ∨ Q is True when at least one of P or Q is True.
+
+Truth Table:
+
+| P | Q | P ∨ Q |
+|---|---|-------|
+| T | T | T |
+| T | F | T |
+| F | T | T |
+| F | F | F |
+
+### Student Task
+
+Create the `Or` class.
+
+# Task 6: Implement Implication
+
+Implement:
+
+P → Q
+
+An implication is False only when:
+
+P = True and Q = False
+
+Truth Table:
+
+| P | Q | P → Q |
+|---|---|-------|
+| T | T | T |
+| T | F | F |
+| F | T | T |
+| F | F | T |
+
+### Student Task
+
+Create the `Implication` class.
+
+# Task 7: Implement Biconditional
+
+Implement:
+
+P ↔ Q
+
+A biconditional is True when P and Q have the same truth value.
+
+Truth Table:
+
+| P | Q | P ↔ Q |
+|---|---|-------|
+| T | T | T |
+| T | F | F |
+| F | T | F |
+| F | F | T |
+
+### Student Task
+
+Create the `Biconditional` class.
+
+# Task 8: Create Propositions
+
+Create three propositions:
+
+P
+Q
+R
+
+Use the `Symbol` class created above.
+
+### Student Task
+
+Create the three symbols and display them.
+
+# Task 9: Test the Logical Operators
+
+Create the following model:
+
+P = True
+Q = False
+
+Use the model to test:
+
+1. P
+2. ¬P
+3. P ∧ Q
+4. P ∨ Q
+5. P → Q
+6. P ↔ Q
+
+### Student Task
+
+Write Python code to evaluate all six expressions.
+
+# Task 10: Implement Model Checking
+
+Now implement the Model Checking algorithm.
+
+The function should determine whether:
+
+KB ⊨ Query
+
+### Algorithm
+
+1. Collect all symbols present in the Knowledge Base and Query.
+2. Generate all possible truth assignments.
+3. If the Knowledge Base is True for a model, check the Query.
+4. If the Query is False in even one model where the KB is True, return False.
+5. Otherwise return True.
+
+### Student Task
+
+Complete the following function.
+
+### Hint
+
+Use recursion.
+
+For each symbol, create two possibilities:
+
+- Symbol = True
+- Symbol = False
+
+# Task 11: Test Case 1
+
+Knowledge Base:
+
+P → Q
+
+Query:
+
+Q
+
+### Question
+
+Does the Knowledge Base entail Q?
+
+### Expected Output
+
+False
+
+### Student Task
+
+Create the Knowledge Base and Query and use `model_check()` to obtain the result.
+
+# Task 12: Test Case 2
+
+Knowledge Base:
+
+(P → Q) ∧ P
+
+Query:
+
+Q
+
+This represents:
+
+1. If P is true, then Q is true.
+2. P is true.
+
+Therefore, according to Modus Ponens:
+
+Q should be true.
+
+### Expected Output
+
+True
+
+### Student Task
+
+Construct the Knowledge Base and Query using the classes developed above.
+
+# Task 13: Test Case 3
+
+Knowledge Base:
+
+(P ∨ Q) ∧ ¬P
+
+Query:
+
+Q
+
+### Question
+
+Does the Knowledge Base entail Q?
+
+### Expected Output
+
+True
+
+### Student Task
+
+Construct the Knowledge Base using:
+
+- And
+- Or
+- Not
+
+Then perform model checking.
+
+# Task 14: Test Case 4
+
+Knowledge Base:
+
+P ↔ Q
+
+Query:
+
+P
+
+### Question
+
+Does the Knowledge Base entail P?
+
+### Expected Output
+
+False
+
+### Student Task
+
+Implement the test using the `Biconditional` class.
+
+Also explain in one or two sentences why the answer is False.
+
+# Task 15: Three-Condition Inference
+
+Consider the following Knowledge Base:
+
+(P → Q) ∧ (Q → R) ∧ P
+
+Query:
+
+R
+
+### Reasoning
+
+If:
+
+P → Q
+
+and:
+
+Q → R
+
+and:
+
+P
+
+then:
+
+P → Q → R
+
+Therefore, R should follow from the Knowledge Base.
+
+### Student Task
+
+Construct the complete Knowledge Base using nested `And` and `Implication` objects.
+
+Then use Model Checking to determine whether:
+
+KB ⊨ R
+
+# Task 16: Modify the Knowledge Base
+
+Now remove the fact P from the Knowledge Base.
+
+New Knowledge Base:
+
+(P → Q) ∧ (Q → R)
+
+Query:
+
+R
+
+### Student Task
+
+1. Modify the Knowledge Base.
+2. Run Model Checking.
+3. Observe the result.
+4. Explain why the answer is different from Task 15.
+
+# Task 17: Create Your Own Knowledge Base
+
+Create your own Knowledge Base using:
+
+- At least 3 propositions
+- At least 2 different logical operators
+
+Your Knowledge Base should contain meaningful logical relationships.
+
+For example, you may use:
+
+P, Q, R
+
+### Student Task
+
+1. Create the Knowledge Base.
+2. Create a Query.
+3. Apply Model Checking.
+4. Record whether the KB entails the Query.
+5. Explain the result.
+
+

npsai-1.0.0/Num/data/assignment8.txt

@@ -0,0 +1,7 @@
+Assignment 8 (Bayes Theorem and Spam Classification)
+
+QUESTION
+Load an SMS spam CSV; encode ham/spam; split training and test sets; build CountVectorizer features; train MultinomialNB; report accuracy, confusion matrix and classification report; classify two new messages.
+
+SOURCE NOTE
+Question reconstructed from the submitted Lab 8 code because Teams Instructions is None. No separate teacher question sheet was attached. Included CSV is synthetic demo data.

npsai-1.0.0/Num/data/assignment9.txt

@@ -0,0 +1,7 @@
+Assignment 9 (Bayesian Belief Network)
+
+QUESTION
+Build the submitted nine-variable Bayesian network A-I with its exact CPTs. Validate it; print CPTs and adjacency; draw the network; compute marginal, conditional, joint, MAP and independence queries; cross-check the 15 textbook probability queries by enumeration.
+
+SOURCE NOTE
+Question reconstructed from the submitted Lab 9 code because Teams Instructions is None. All submitted CPTs, example queries and enumeration checks are retained.

npsai-1.0.0/Num/data/catalog.json

@@ -0,0 +1,32 @@
+[
+  {
+    "number": 2,
+    "title": "Agents",
+    "function": "assignment2_agents"
+  },
+  {
+    "number": 3,
+    "title": "BFS and DFS",
+    "function": "assignment3_bfs_dfs"
+  },
+  {
+    "number": 4,
+    "title": "Informed Search",
+    "function": "assignment4_informed_search"
+  },
+  {
+    "number": 6,
+    "title": "Model Checking Algorithm",
+    "function": "assignment6_model_checking"
+  },
+  {
+    "number": 8,
+    "title": "Bayes Theorem and Spam Classification",
+    "function": "assignment8_bayes_theorem"
+  },
+  {
+    "number": 9,
+    "title": "Bayesian Belief Network",
+    "function": "assignment9_bayesian_belief_network"
+  }
+]

npsai-1.0.0/Num/data/demo_spam.csv

@@ -0,0 +1,33 @@
+Label,Message
+ham,Are we meeting today
+ham,Please call me after class
+ham,Lunch at noon with friends
+ham,I will reach home soon
+ham,Send me the lecture notes
+ham,The project meeting is tomorrow
+ham,Can you bring my book
+ham,Let us study for the exam
+ham,See you at the library
+ham,Your appointment is at ten
+ham,Thanks for helping yesterday
+ham,Please buy milk on your way
+ham,We have class this morning
+ham,I am waiting near the station
+ham,Dinner is ready at home
+ham,Remember to submit your homework
+spam,Congratulations win a free ticket now
+spam,Claim your cash prize today
+spam,Free offer click now to win
+spam,You won a lottery claim your prize
+spam,Exclusive discount offer buy now
+spam,Win cash with this free offer
+spam,Urgent claim your winning voucher
+spam,Click here for a free prize
+spam,Congratulations your reward is waiting
+spam,Limited offer get free tickets
+spam,You are selected for a cash reward
+spam,Claim a free holiday voucher now
+spam,Win a bonus prize click today
+spam,Special promotion buy one get free
+spam,Your lottery reward expires today
+spam,Click now and claim cash bonus