The PSL software uses concepts from the core PSL paper, and introduces new ones for advanced data management and machine learning. On this page, we define the commonly used terms and point out the corresponding classes in the code base.
Please note that this page is organized conceptually, not alphabetically.
Hinge-loss Markov random field: A factor graph defined over continuous variables in the [0,1] interval with (log) factors that are hinge-loss functions. Many classes in PSL work together to implement the functionality of HL-MRFs.
A logical relationship corresponding to a random variable in a HL-MRF.
Friends("Steve", "Jay") is an alias for a specific random variable.
Random variable atom: A ground atom that is unobserved, i.e., no value is known for it. A HL-MRF assigns probability densities to assignments to random variable atoms.
Observed atom: A ground atom that has an observed, immutable value. HL-MRFs are conditioned on observed atoms.
A generalization of ground atoms that allow logical variables as placeholders for constant arguments.
Friends("Steve", A) is a placeholder for all the ground atoms that can be obtained by substituting constants for the logical variable
PSL Program: A set of rules, each of which is a template for hinge-loss potentials or hard linear constraints. When grounded over a base of ground atoms, a PSL program induces a HL-MRF conditioned on any specified observations.
Rule: See Rule Specification.
See this page for more details.
Data Store: An entire data repository, such as a relational database management system (RDBMS).
Partition: A logical division of ground atoms in a data store.
Database: A logical view of a data store, constructed by specifying a write partition and one or more read partitions of a data store.
Open Predicate: A predicate whose atoms can be random variable atoms, i.e., unobserved. The only time a ground atom will be loaded as a random variable atom is when it is stored in the database’s write partition and its predicate is not specified as closed. Otherwise it will be loaded as an observed atom. Whether a predicate is open or closed is specific to each database.
Closed Predicate: A predicate whose atoms are always observed atoms. The only time a ground atom will be loaded as a random variable atom is when it is stored in the database’s write partition and its predicate is not specified as closed. Otherwise it will be loaded as an observed atom. Whether a predicate is open or closed is specific to each database.Edit This Page