ConceptSystems & CS
Rule
A transformation of an expression to a logically equivalent expression, divided into transformation rules and implementation rules.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Hal Abelson & Gerald Jay Sussman
Rules serve as the means of abstraction in the logic programming language, allowing compound queries to be named.Andy Pavlo
Lectures that assume it
8- Chaos and Reductionism
- Normative Ethics: Utilitarianism, Kantian Deontology, and Aristotelian Virtue
- Pattern Matching and Rule-Based Substitution
- Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
- Rule-Based Systems: Backward and Forward Chaining (MIT 6.034 Artificial Intelligence)
- Reasoning: Goal Trees and Rule-Based Expert Systems
- Cognitive Science Tools for Understanding LLM Behavior
- Introduction and Scope of Artificial Intelligence
Connections
23The lectures that define it or assume it, and the concepts next to it.
Concepts10
Show 4 moreShow fewer
Lectures13
- Logic Programming, Part 2: MIT 6.001 Structure and Interpretation (1986)
- Query Optimizer Implementation 2
- Logic Programming, Part 1
- Cascades Query Optimizer
- Logic Programming, Part 2 (SICP Lecture 8b)
- Chaos and Reductionism
Show 7 moreShow fewer
- Normative Ethics: Utilitarianism, Kantian Deontology, and Aristotelian Virtue
- Pattern Matching and Rule-Based Substitution
- Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
- Rule-Based Systems: Backward and Forward Chaining (MIT 6.034 Artificial Intelligence)
- Reasoning: Goal Trees and Rule-Based Expert Systems
- Cognitive Science Tools for Understanding LLM Behavior
- Introduction and Scope of Artificial Intelligence