![]() |
ProvSQL C/C++ API
Adding support for provenance and uncertainty management to PostgreSQL databases
|
Abstract base class for (m-)semirings. More...
#include "Semiring.h"
Public Types | |
| typedef V | value_type |
| The carrier type of this semiring. | |
Public Member Functions | |
| virtual value_type | zero () const =0 |
| Return the additive identity \(\mathbb{0}\). | |
| virtual value_type | one () const =0 |
| Return the multiplicative identity \(\mathbb{1}\). | |
| virtual value_type | plus (const std::vector< value_type > &v) const =0 |
| Apply the additive operation to a list of values. | |
| virtual value_type | times (const std::vector< value_type > &v) const =0 |
| Apply the multiplicative operation to a list of values. | |
| virtual value_type | monus (value_type x, value_type y) const =0 |
| Apply the monus (m-semiring difference) operation. | |
| virtual value_type | delta (value_type x) const =0 |
| Apply the \(\delta\) operator. | |
| virtual value_type | cmp (value_type s1, ComparisonOperator op, value_type s2) const |
| Evaluate a comparison gate. | |
| virtual value_type | semimod (value_type x, value_type s) const |
| Apply a semimodule scalar multiplication. | |
| virtual value_type | agg (AggregationOperator op, const std::vector< value_type > &s) |
| Evaluate an aggregation gate. | |
| virtual value_type | value (const std::string &s) const |
| Interpret a literal string as a semiring value. | |
| virtual | ~Semiring ()=default |
| virtual bool | absorptive () const |
Return true if this semiring is absorptive ( \(\mathbb{1} \oplus a = \mathbb{1}\) for all \(a\)). | |
| virtual bool | compatibleWithBooleanRewrite () const |
Return true if a semiring homomorphism BoolFunc(X) →+* S exists, so the safe-query (Boolean-rewrite) optimisation produces circuits that are semantically faithful when evaluated under this semiring. | |
| virtual bool | certifying () const |
| Whether this semiring builds certified exclusive enumerations (see the three hooks below). | |
| virtual bool | independent_literal (const value_type &) const |
Whether v is an independent literal for certification purposes: a base Bernoulli variable (or a constant), so that distinct literals have disjoint supports and an AND over them is decomposable. | |
| virtual value_type | certified_world_term (const std::vector< value_type > &, const std::vector< value_type > &) const |
Build one complete world term: the conjunction of the present literals and the negations of the missing literals, certified decomposable. | |
| virtual value_type | certified_exclusive_plus (const std::vector< value_type > &) const |
Build the disjunction of pairwise-exclusive disjuncts, certified deterministic. | |
Abstract base class for (m-)semirings.
| V | The carrier type (e.g. bool, unsigned, std::string). |
All pure-virtual methods must be implemented by concrete subclasses.
cmp(), semimod(), agg(), and value() have default implementations that throw SemiringException. Override them in subclasses that support these circuit gate types.
A semiring is absorptive (i.e., \(\mathbb{1} \oplus a = \mathbb{1}\) for all \(a\)) iff absorptive() returns true. Absorptivity implies idempotency ( \(a \oplus a = a\)), which lets the circuit evaluator and the HAVING-semantics machinery deduplicate operands and short-circuit over the multiplicative identity.
Definition at line 92 of file Semiring.h.
| typedef V semiring::Semiring< V >::value_type |
The carrier type of this semiring.
Definition at line 96 of file Semiring.h.
|
virtualdefault |
|
inlinevirtual |
Return true if this semiring is absorptive ( \(\mathbb{1} \oplus a = \mathbb{1}\) for all \(a\)).
When true, the circuit evaluator and HAVING-semantics machinery may exploit the resulting idempotency ( \(a \oplus a = a\), implied by absorptivity) to deduplicate children of plus gates and to short-circuit over the multiplicative identity.
false by default; override to return true. Reimplemented in semiring::Boolean, semiring::BoolExpr, semiring::IntervalUnion, semiring::Lukasiewicz, semiring::MinMax, semiring::TropicalNonneg, and semiring::Viterbi.
Definition at line 206 of file Semiring.h.
|
inlinevirtual |
Evaluate an aggregation gate.
| op | The aggregation function (COUNT, SUM, MIN…). |
| s | List of child semiring values to aggregate. |
| SemiringException | if not overridden. |
Reimplemented in semiring::Formula.
Definition at line 176 of file Semiring.h.
|
inlinevirtual |
Build the disjunction of pairwise-exclusive disjuncts, certified deterministic.
Only called when certifying() is true; the default throws.
Reimplemented in semiring::BoolExpr.
Definition at line 287 of file Semiring.h.
|
inlinevirtual |
Build one complete world term: the conjunction of the present literals and the negations of the missing literals, certified decomposable.
Only called when certifying() is true; the default throws.
Reimplemented in semiring::BoolExpr.
Definition at line 275 of file Semiring.h.
|
inlinevirtual |
Whether this semiring builds certified exclusive enumerations (see the three hooks below).
The HAVING possible-worlds machinery (provsql_having) enumerates, for a comparison over a group aggregate, the complete valuations of the group's contributors that satisfy the predicate. Those disjuncts partition the worlds – the OR is deterministic and each world term an AND of literals over distinct contributors, decomposable – i.e., the enumeration is a d-DNNF by construction. A circuit-building semiring can persist that knowledge as the d-DNNF certificate (the same mark the bounded-treewidth reachability route emits), letting the linear certificate-aware evaluators handle the result; scalar semirings have nothing to mark.
false by default (the hooks below then go unused and the default constructions are used). Reimplemented in semiring::BoolExpr.
Definition at line 250 of file Semiring.h.
|
inlinevirtual |
Evaluate a comparison gate.
| s1 | Left operand. |
| op | Comparison operator. |
| s2 | Right operand. |
| SemiringException | if not overridden. |
Reimplemented in semiring::Formula.
Definition at line 152 of file Semiring.h.
|
inlinevirtual |
Return true if a semiring homomorphism BoolFunc(X) →+* S exists, so the safe-query (Boolean-rewrite) optimisation produces circuits that are semantically faithful when evaluated under this semiring.
The compiled-semiring dispatcher consults this predicate before evaluating a circuit whose root gate carries PROVSQL_ROOT_TAG_BOOLEAN_REWRITE. Returning false on a tagged circuit raises CircuitException.
Defaults to false: a new semiring whose author has not yet verified the homomorphism is fail-closed by construction. Subclasses with a verified homomorphism (currently Boolean, BoolExpr, Formula, and IntervalUnion) override to return true. The justification (Lean-proof reference) belongs in a comment next to each override; see the src/semiring/ headers.
Reimplemented in semiring::Boolean, semiring::BoolExpr, semiring::Counting, semiring::Formula, semiring::How, semiring::IntervalUnion, semiring::Lukasiewicz, semiring::MinMax, semiring::Tropical, semiring::Viterbi, semiring::Which, and semiring::Why.
Definition at line 228 of file Semiring.h.
|
pure virtual |
Apply the \(\delta\) operator.
| x | Input value. |
Implemented in semiring::Boolean, semiring::BoolExpr, semiring::Counting, semiring::Formula, semiring::How, semiring::IntervalUnion, semiring::Lukasiewicz, semiring::MinMax, semiring::Tropical, semiring::Viterbi, semiring::Which, and semiring::Why.
|
inlinevirtual |
Whether v is an independent literal for certification purposes: a base Bernoulli variable (or a constant), so that distinct literals have disjoint supports and an AND over them is decomposable.
Only consulted when certifying() is true.
false by default. Reimplemented in semiring::BoolExpr.
Definition at line 264 of file Semiring.h.
|
pure virtual |
Apply the monus (m-semiring difference) operation.
| x | Minuend. |
| y | Subtrahend. |
Implemented in semiring::Boolean, semiring::BoolExpr, semiring::Counting, semiring::Formula, semiring::How, semiring::IntervalUnion, semiring::Lukasiewicz, semiring::MinMax, semiring::Tropical, semiring::Viterbi, semiring::Which, and semiring::Why.
|
pure virtual |
Return the multiplicative identity \(\mathbb{1}\).
Implemented in semiring::Boolean, semiring::BoolExpr, semiring::Counting, semiring::Formula, semiring::How, semiring::IntervalUnion, semiring::Lukasiewicz, semiring::MinMax, semiring::Tropical, semiring::Viterbi, semiring::Which, and semiring::Why.
|
pure virtual |
Apply the additive operation to a list of values.
| v | Ordered list of operands (empty list should return zero()). |
Implemented in semiring::Boolean, semiring::BoolExpr, semiring::Counting, semiring::Formula, semiring::How, semiring::IntervalUnion, semiring::Lukasiewicz, semiring::MinMax, semiring::Tropical, semiring::Viterbi, semiring::Which, and semiring::Why.
|
inlinevirtual |
Apply a semimodule scalar multiplication.
| x | Provenance value. |
| s | Scalar value. |
| SemiringException | if not overridden. |
Reimplemented in semiring::Formula.
Definition at line 164 of file Semiring.h.
|
pure virtual |
Apply the multiplicative operation to a list of values.
| v | Ordered list of operands (empty list should return one()). |
Implemented in semiring::Boolean, semiring::BoolExpr, semiring::Counting, semiring::Formula, semiring::How, semiring::IntervalUnion, semiring::Lukasiewicz, semiring::MinMax, semiring::Tropical, semiring::Viterbi, semiring::Which, and semiring::Why.
|
inlinevirtual |
Interpret a literal string as a semiring value.
Used for gate_value gates whose payload is a string.
| s | Literal string. |
| SemiringException | if not overridden. |
Reimplemented in semiring::Formula.
Definition at line 189 of file Semiring.h.
|
pure virtual |
Return the additive identity \(\mathbb{0}\).
Implemented in semiring::Boolean, semiring::BoolExpr, semiring::Counting, semiring::Formula, semiring::How, semiring::IntervalUnion, semiring::Lukasiewicz, semiring::MinMax, semiring::Tropical, semiring::Viterbi, semiring::Which, and semiring::Why.