Oughtomation is published by xalgorithms.org and is described as follows:
Oughtomation is any simple, factual, general-purpose computational method that gives effect to MUST, MAY and SHOULD assertions amongst individual and organizational agents.
This paper, An Introduction to 'Oughtomation', provides a high-level overview of rules.
Oughtomation appears to be engineered to be very safe, similar to Datalog. For more information about problem solving paradigms, logic, and rules see this blog post and this blog post. The following is from an explanation provided of Oughtomation to me in an email:
Our method is more like Datalog, the simpler subset of Prolog. We're concerned with declarative facts and rules, and we limit functions to simple arithmetic and boolean operations. In Datalog rules can be expressed as two-part clauses: the facts (input conditions of the rule.xa records) and its logical implications (output assertions of the rule.xa records). These are combined in our system with transient facts (is.xa message) and the whole set of logical implications (ought.xa message). Facts alone (lookup.xa records) are like rules but with no implications. A fact asserts a predicate being true for a particular combination of values. And each rule asserts that GIVEN a context, WHEN certain facts occur in specific relations, THEN an additional fact is deemed to exist in a derived relation. (Maier et al., 2018, pp. 3–5) This provides the basis for programming with first-order logic. Datalog separates statements of logical relations from resolution procedures, so that programmers can focus on specifying the logical relations with purely declarative facts and rules. The machine optimizes how each problem is to be solved using its available procedures.
Computational professional services is becoming more and more real!
####################################
XF Grammar (XBRL International)