Tree @master (Download .tar.gz)
Samovar
Version 0.6 | Entry @ catseye.tc | See also: The League of Extraordinarily Dull Gentlemen ∘ The Swallows

Samovar is a domain-specific language (DSL) for modelling a world using propositions (facts), and possible events that can occur based on those facts, changing them.
Here is a short example of a Samovar description:
scenario IgnatzWithBrick {
[actor(?A),item(?I),~holding(?A,?I)] ?A picks up the ?I. [holding(?A,?I)]
[actor(?A),item(?I),holding(?A,?I)] ?A puts down the ?I. [~holding(?A,?I)]
actor(Ignatz).
item(brick).
goal [].
}
And an implementation of Samovar could take this scenario and use it to, among other things, generate textual descriptions of chains of events like
Ignatz picks up the brick. Ignatz puts down the brick.
Of course, this is a very simple example. (It doesn't even prevent two actors from picking up the same item at the same time!) For more complex examples, and a fuller description of the language, see doc/Samovar.md, which also serves as a test suite.
Implementation
The reference implementation of Samovar, samovar, is written in Python.
It can run under either Python 2.7 or Python 3.x (tested with 3.5 or higher.)
Discussion
This looks like logic programming but the internals are actually much simpler, and what it's doing is not logical inference.
The internals are far simpler than an inference engine or a theorem prover: there are no logical rules in the database, only propositions, so they can be selected by simple pattern-matching rather than full unification.
I originally described it as an "assertion-retraction engine", which could be thought of as a highly stylized form of Prolog programming. Alternately, it could be thought of as assigning preconditions and postconditions, like in Hoare logic, to actions in a world-model. Instead of constructing a proof, though, we simply chain actions together, by selecting any next one whose preconditions hold, and altering the world so that its postconditions hold.
In (I think) autumn 2019, I came across the concept of a production system, and I realized that is basically what Samovar implements. Researching it further, I discovered CLIPS, a production system built in 1985, and I realized that Samovar is not essentially different from an inefficiently-implemented, stripped-down version of CLIPS.
The main innovation in Samovar is the ability to "narrate" the choices the production system makes, with human-readable text.
This isn't too surprising, since my goal with Samovar was to make an expressive language, a syntax in which the author could write a story generator without the undue effort of switching context between prose and code. Picking logical propositions for the "code" and placing them before and after each fragment of prose was a reasonably "ergonomic" choice, and happens to coincide with the structure of a production system.
TODO
- Maybe allow variables to be notated so that they can bind reflexively,
e.g.
?*A looks at ?*Bcan bind both variables to Alice. - Make
?_work such that you can say¬holding(?_, club)to mean "if no one is holding the club".
Commit History
@master
git clone https://git.catseye.tc/Samovar/
- Add logo. Chris Pressey 2 years ago
- Update links. Chris Pressey 2 years ago
- Update .gitignore. Chris Pressey 2 years ago
- Rename package to avoid name conflict. Chris Pressey 2 years ago
- Bump version number, prepare to distribute as Python package Chris Pressey 2 years ago
- Merge pull request #13 from catseye/develop-0.5 Chris Pressey (commit: GitHub) 3 years ago
- Minor edit to README. Chris Pressey 3 years ago
- Reduce memory usage of depth-first search. Chris Pressey 3 years ago
- Add some debug output. Chris Pressey 3 years ago
- Rewrite recursion to use explicit stack. Chris Pressey 3 years ago
- Update documentation. Chris Pressey 3 years ago
- Add experimental depth-first generator. Chris Pressey 3 years ago
- Rename the breadth-first generator. Chris Pressey 3 years ago
- Mere progress is reported at verbosity level 1. Chris Pressey 3 years ago
- Have match() return None if no match (faster than raising.) Chris Pressey 3 years ago
- Don't check for free vars (tho this does not help performance much) Chris Pressey 3 years ago
- Don't re-consider states that we have already considered. Chris Pressey 3 years ago
- Make candidate_rules() a generator. Chris Pressey 3 years ago
- Rules that don't change the state are not worth considering. Chris Pressey 3 years ago
- Replace `--randomness-type` with `--deterministic`. Chris Pressey 3 years ago
- Rename "random" generator to "stochastic" generator. Chris Pressey 3 years ago
- Fix some bugs. The complete generator does indeed seem to work. Chris Pressey 3 years ago
- Make the sketch of the complete generator less rough. Chris Pressey 3 years ago
- Factor common methods into base class. Chris Pressey 3 years ago
- Refactor so generate_events() has same signature in both classes Chris Pressey 3 years ago
- Allow generator to be selected; have both confirm to base interface Chris Pressey 3 years ago
- flake8 (mainly the argparser setup) Chris Pressey 3 years ago
- Add base class for Generators. Chris Pressey 3 years ago
- Add rough sketch of CompleteGenerator. Chris Pressey 3 years ago
- Establish new `generators` sub-package, allowing more kinds of. Chris Pressey 3 years ago