Against Truth
+Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Against Truth
“Hey, what IS truth, man?” Beeblebrox, Z, quoted in [Adams, 1978]
diff --git a/docs/codox/Analysis.html b/docs/codox/Analysis.html index d387c6b..192846f 100644 --- a/docs/codox/Analysis.html +++ b/docs/codox/Analysis.html @@ -1,6 +1,6 @@ -Analysis Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Analysis
+Analysis Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Analysis
Accounts from the Philosophy of Science
(Towards another chapter. What l want to do is: ,
diff --git a/docs/codox/Arboretum.html b/docs/codox/Arboretum.html index dd478ba..439b2c5 100644 --- a/docs/codox/Arboretum.html +++ b/docs/codox/Arboretum.html @@ -1,6 +1,6 @@ -
Arboretum Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Arboretum
+Arboretum Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Arboretum
This chapter describes briefly an inference mechanism, implemented in the Arboretum prototype; this is included here to show the results achieved in the author’s early work on explanation, on which it is hoped to build in the current work. A fuller description of this mechanism, and of the Arboretum prototype, will be found in [Mott & Brooke 87], from which this chapter is largely drawn.
Arboretum was written in InterLisp-D[4] using LOOPS [5] object oriented facilities, to allow people to manipulate DTree structures through graphical representations: to build arbitrarily large knowledge bases, to use these to provide answers to questions about objects in domains admitting incomplete information - and to provide natural language explanations of these answers. The inference process by which answers are produced is shown as an animated graph. The user can ask the system how the value of any particular feature was arrived at, and what that value was. . It was developed for the Alvey DHSS Large Demonstrator Project, and sought to meet early perceptions of the needs of DHSS Adjudication Officers. Adjudication Officers decide claimants’ eligibility over a wide range of welfare benefits. There is a very large volume of work to be done, so they work under considerable pressure.
The Adjudication process within the DHSS has its own levels of authority culminating in the
diff --git a/docs/codox/Arden.html b/docs/codox/Arden.html index 0d3474f..5bb81df 100644 --- a/docs/codox/Arden.html +++ b/docs/codox/Arden.html @@ -1,6 +1,6 @@ -Arden Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Arden
+Arden Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Arden
Why Arden?
It was something of tradition in the InterLisp-D community to give successive versions of a project codenames with successive alphabetical initials. So the first version would have a name starting ‘A’, the second ‘B’, and so on. The first prototype for Wildwood was called ‘Arden’, because it starts with an ‘A’, and because it is a fantastical dream-like forest depicted in Shakespeare’s play ‘As You Like It’, which if I recall correctly was performed as a promenade performance by the Duke’s Theatre in Lancaster in that year. While Arboretum - that carefully tended garden of trees - had been, as I’ve said, largely Peter’s in concept, Wildwood would be mine.
Background
diff --git a/docs/codox/BatesonKammerer.html b/docs/codox/BatesonKammerer.html index 35607eb..59a65ce 100644 --- a/docs/codox/BatesonKammerer.html +++ b/docs/codox/BatesonKammerer.html @@ -1,4 +1,4 @@ -The Bateson / Kammerer debate Generated by Codox
Wildwood 0.1.0-SNAPSHOT
The Bateson / Kammerer debate
+The Bateson / Kammerer debate Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/Bialowieza.html b/docs/codox/Bialowieza.html index fb7df27..cccf5ea 100644 --- a/docs/codox/Bialowieza.html +++ b/docs/codox/Bialowieza.html @@ -1,6 +1,6 @@ -Bialowieza Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Bialowieza
+Bialowieza Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Bialowieza
{ this chapter is in active development; quite a lot of the technical detail in this chapter at present will probably end up in Implementing, while additional high level and conceptual design, as it develops, will be here. }
Why Bialowieza?
Bialowieza is the second iteration of the Wildwood engine, and this following convention its name should start with ‘B’. Białowieża is Europe’s last great wild wood, and it is currently under threat.
@@ -53,7 +53,7 @@So what, then, is an ‘argument structure’, as described above? It seems to me that it may be exactly a proposition, with the special feature that the value of the
:data
key is not minimised.Recall that in the chapter on Arboretum I observed that the working of the DTree decision algorithm caused precisely those nodes to be collected whose fragments which provided the most relevant explanation to support the decision, in a natural sequence from the general to the particular. I believe that precisely the same fortuitous alchemy will provide the argument structure to provide Toulmin’s D - out
:data
term. The DTree itself then becomes the W - the:warrant
; and the author of the DTree becomes the:authority
.{ TODO: investigate how this notion of a proposition - and a Toulmin structure - relates to situation semantics; especially, consider how locating a proposition in time and space captures the notion of a situation. }
-Are located two-position propositions sufficient?
+The located proposition
Aristotle’s propositions are essentially two position: they describe a relationship between two entities, a subject and an object. But they’re not located.
Thus:
@@ -75,8 +75,9 @@
- Dagger1 caused Wound1 in the Forum on the Ides of March
- Caesar died of Wound1 in the Forum on the Ides of March
-then provided the atomicity of our notions of time and space is sufficiently fine, we’re getting pretty close.
-Adding a notion of location to propositions leads to the notion of an event, a small bundle or ball of time and space which gives them context; and we can reason with this.
+then provided the atomicity of our notions of time and space is sufficiently fine, we’re getting pretty close. Adding a notion of location to propositions leads to the notion of an event, a small bundle or ball of time and space which gives them context; and we can reason with this.
+The size of an event is, of course, a slightly slippery notion. The inference that Caesar died (at least partly) from the blow struck by Brutus is only possible if the envelope of the event is fairly small - no more than a few metres, no more than a few minutes. But if we replace Dagger1 with Rifle1 then the spatial extent of the event can be considerable expanded; and if it’s LandMine1, then the temporal aspect similarly so.
+Are located two-position propositions sufficient?
The reason I like the idea of investigating whether located two position propositions are sufficient is that a very regular knowlege representation is easy to compute over. The reason I think it might not be is this:
Suppose Calpurnia told Drusilla that Brutus killed Caesar in the Forum on the Ides of March. For simplicity, let’s call
@@ -92,8 +93,93 @@
And the warrant for the belief that P1 is the conjunction of P2 and P3.
Writing it down like that, it kind of works, but I’m not yet wholly persuaded. It feels clumsy.
As an exercise for the reader, how would we represent ‘Dirck, Joris and I carried the good news from Ghent to Aix’ using only located two position propositions? It feels, as I said, clumsy.
-There is, of course, also a lurking combinatorial explosion here. If for each proposition which is learned, two further propositions must be learned as warrant for the first proposition, the world blows up. In an ideal platonic world we may indeed have turtles all the way down, but in a finite machine we need to say, arbitrarily but ruthlessly, that some classes of proposition will be stored unwarranted.
-Learning, consistency and confidence
+There is, of course, also a lurking combinatorial explosion here. If for each proposition which is learned, two further propositions must be learned as warrant for the first proposition, the world blows up. In an ideal platonic universe we may indeed have turtles all the way down, but in a finite machine we need to say, arbitrarily but ruthlessly, that some classes of proposition will be stored unwarranted.
+The event is (like) a situation
+I would draw the reader’s attention, here, to the similarity between the notion of an event, discussed above, and the notion of a situation, as discussed by Barwise & Perry. In particular, I’d like to draw attention to similarity between the account I’ve given of how Drusilla’s belief that Brutus killed Caesar is warranted by
++
+- P2 := ‘Calpurnia uttered P1 at E1.’
+- P3 := ‘Drusilla heard P1 at E1.’
+and the account of explanation as a situation E defined:
++E := at I1: understands, a, c; no + understands, b, c; yes + enquirlng, a; yes + addressing, a, b; yes + saying, a, q; yes + subject, q, c; yes + + at I2: responding, b, q; yes + addressing, b, a; yes + saying, b, u; yes + subject, u, c; yes + + at I3: understands, a, c; yes + understands, b, c; yes + + I1 < I2 < I3 +
where: a, b are some actors; c is some concept; q, u are some utterances.
+Explicitly:
++
+- Drusilla => a
+- Calpurnia => b
+- P1 => c
+- E1 => I2
+I’d argue that these are clearly very similar.
+My schema does not specify that “at I1: … understands, a, c; no”, but there’s a reason for that.
+Learning, consistency and confidence
+Let us suppose that Drusilla already knows the proposition that
++
+- Brutus killed Caesar in Rome in March.
+Calpurnia now tells her that
++
+- Brutus killed Caesar in the Forum on the Ides of March.
+The two accounts are compatible; this compatibility migh be represented, if you choose, by two further propositions:
++
+- P4 The Forum is within Rome.
+- P5 The Ides of March is within March.
+Philosophers, after Plato, very often argue as though they inhabited ideal universes in which every agent always tells the truth, but the real world is not like that. For any person, there are few other people that that person trusts implicitly. The very notion that we need a warrant for a belief is an explicit recognition of the fact that knowledge is imperfect.
+So (unless she witnessed it herself, in which case you’d expect her to have more precise information), Drusilla does not know, in a strong sense, that Brutus killed Caesar in Rome in March. She has some degree of confidence in that proposition, which is likely to be less than perfect.
+When she learns from Calpurnia that Brutus killed Caesar in the Forum on the Ides of March, because the two claims are compatible, her confidence in each is likely to increase.
+By contrast, if Falco then says ‘No, I heard from Gaius that it happened in April’, then that casts doubt on both the first two claims - but also on this new claim. Because the claims are not compatible, they can’t all be right.
+For the time being, I’m going to leave the issue of how confidence is derived and adjusted as an implementation detail; I don’t - yet, at any rate - have an account of how this should work that I can defend. However, there’s one further significant point to make about propositions before we move on.
+On the subtext of propositions
+Propositions are not atomic. They do not come single spies, but freighted with battalions of inferable subtexts. Suppose Calpurnia says
++
+- Brutus killed Caesar in Rome during the ides of March
+I learn more than just that ‘Brutus killed Caesar in Rome during the ides of March’. I also learn that
++
+- Brutus is a killer
+- Caesar has been killed
+- Rome is a place where killings happen
+- The Ides of March are a time to be extra cautious
+Suppose Cassius now says
++
+- Longus killed Caesar in Rome during the ides of March
+this may cast some doubt on Calpurnia’s primary claim, and on the belief that Brutus is a killer. It doesn’t rule it out - the accounts are compatible - but it certainly doesn’t confirm it. However it does reinforce the beliefs that
++
+- Caesar has been killed
+- Rome is a place where killings happen
+- The ides of March are a time to be extra cautious.
+If Falco then says
++
+- No, I heard from Gaius that it happened in April
+the beliefs that
++
+- Caesar has been killed
+- Rome is a place where killings happen
+are still further strengthened.
+In proposing a formalism to express propositions, we need to consider how it allows this freight to be unpacked.
{ TODO: if we receive a new proposition which confirms a proposition we already know, our confidence in both increases. If we learn a new one which contradicts one we already know, our confidence in both decreases. Expand! }
Proposition minimisation
{ TODO: probably lose this. I increasingly think that, whatever the internal representation of the proposition within the advocate or knowledge base, the proposition as passed around must always be minimised. This is, in any case, very much an implementation detail. }
diff --git a/docs/codox/Errata.html b/docs/codox/Errata.html index ae7ba03..9adcd58 100644 --- a/docs/codox/Errata.html +++ b/docs/codox/Errata.html @@ -1,6 +1,6 @@ -Errata Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Errata
+Errata Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/Experience.html b/docs/codox/Experience.html index fe42674..a9f1c8b 100644 --- a/docs/codox/Experience.html +++ b/docs/codox/Experience.html @@ -1,4 +1,4 @@ -Experience Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Experience
+Experience Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/HegemonicArgument.html b/docs/codox/HegemonicArgument.html index fc73f11..1630c86 100644 --- a/docs/codox/HegemonicArgument.html +++ b/docs/codox/HegemonicArgument.html @@ -1,4 +1,4 @@ -Hegemonic Argument Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Hegemonic Argument
+Hegemonic Argument Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/History.html b/docs/codox/History.html index fff7722..8cffb88 100644 --- a/docs/codox/History.html +++ b/docs/codox/History.html @@ -1,6 +1,6 @@ -Hegemonic Argument
{ new chapter, beginning a sequence which argues that the purpose of argument is to achieve hegemony, not find truth. In this chapter we’ll cover the sources we’ve used already, and show that the philosophers of science, whatever they claim about the purpose of argument, actually argue in a highly polemical, persuasive manner, seeking to achieve widespread belief of their chosen position - that is, to achieve hegemony; and further, even those who make strong claims to the value of candour are frequently not candid in their own argument }
History Generated by Codox
Wildwood 0.1.0-SNAPSHOT
History
+History Generated by Codox
Wildwood 0.1.0-SNAPSHOT
History
History: Introduction
The object of this chapter is to describe and discuss the development of Expert System explanations from the beginning’ to the most recent systems. The argument which I will try to advance is that development has been continuously driven by the perceived inadequacy of the explanations given; and that, while many ad hoc, and some principled, approaches have been tried, no really adequate explanation system has emerged. Further, I will claim that, as some of the later and more principled explanation systems accurately model the accounts of explanation advanced in current philosophy, the philosophical understanding of explanation is itself inadequate.
{I ought to add to this chapter to give some overview of what’s happened since 1990, and look at explanations of neural network decisions, because that will help in later parts/chapters of Part One}
diff --git a/docs/codox/HuxleyKropotkin.html b/docs/codox/HuxleyKropotkin.html index f9133b8..2dfecce 100644 --- a/docs/codox/HuxleyKropotkin.html +++ b/docs/codox/HuxleyKropotkin.html @@ -1,4 +1,4 @@ -The Huxley / Kropotkin debate Generated by Codox
Wildwood 0.1.0-SNAPSHOT
The Huxley / Kropotkin debate
+The Huxley / Kropotkin debate Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/Implementing.html b/docs/codox/Implementing.html index 1558920..021bdec 100644 --- a/docs/codox/Implementing.html +++ b/docs/codox/Implementing.html @@ -1,4 +1,4 @@ -Implementing Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Implementing
+Implementing Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/JAccuse.html b/docs/codox/JAccuse.html index c7758fb..45d4c0c 100644 --- a/docs/codox/JAccuse.html +++ b/docs/codox/JAccuse.html @@ -1,6 +1,6 @@ -J'Accuse Generated by Codox
Wildwood 0.1.0-SNAPSHOT
J’Accuse
+J'Accuse Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/KnacqTools.html b/docs/codox/KnacqTools.html index 7d51ebe..35d32b7 100644 --- a/docs/codox/KnacqTools.html +++ b/docs/codox/KnacqTools.html @@ -1,6 +1,6 @@ -KnacqTools Generated by Codox
Wildwood 0.1.0-SNAPSHOT
KnacqTools
+KnacqTools Generated by Codox
Wildwood 0.1.0-SNAPSHOT
KnacqTools
Background
KnacqTools (’Knowledge Acquisition Toolkit") was essentially a productisation of the ideas developed in Arboretum. It was written in C, originally for Acorn’s RISC OS operating system, and later ported to UNIX. The only major innovation of KnacqTools was that it was able to transform DTree knowledge structures into the rule languages of a number of contemporary ‘expert system’ inference engines.
Thus the expected use of KnacqTools was not to run an inference process itself (although of course it could do this), but to allow a knowledge engineer, using Peter Mott’s ‘elicitation by exception’ technique, which I and others had polished in the field, to enter DTrees elicited from domain experts, compile these DTrees into production rules, and export those prodution rules to the selected expert system package for deployment.
diff --git a/docs/codox/Manifesto.html b/docs/codox/Manifesto.html index 79901ba..9b9390c 100644 --- a/docs/codox/Manifesto.html +++ b/docs/codox/Manifesto.html @@ -1,6 +1,6 @@ -Manifesto Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Manifesto
+Manifesto Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Manifesto
Machine inference – automated reasoning, the core of what gets called Artificial Intellegence – has ab initio been based on the assumption that the purpose of reasoning was to preserve truth. It is because this assumption is false that the project has thus far failed to bear fruit, that Allan Turing’s eponymous test has yet to be passed.
Of course it is possible to build machines which, within the constraints of finite store, can accurately compute theora of first order predicate calculus ad nauseam but such machines do not display behaviour which is convincingly intelligent. They are cold and mechanical; we do not recognise ourselves in them. Like the Girl in the Fireplace’s beautiful clocks, they are precisely inhuman.
diff --git a/docs/codox/OnHylasAndPhilonus.html b/docs/codox/OnHylasAndPhilonus.html index 1c53c59..a185b6e 100644 --- a/docs/codox/OnHylasAndPhilonus.html +++ b/docs/codox/OnHylasAndPhilonus.html @@ -1,6 +1,6 @@ -On the First Dialogue of Hylas and Philonous Generated by Codox
Wildwood 0.1.0-SNAPSHOT
On the First Dialogue of Hylas and Philonous
+On the First Dialogue of Hylas and Philonous Generated by Codox
Wildwood 0.1.0-SNAPSHOT
On the First Dialogue of Hylas and Philonous
The argument that our perception of a ‘real world’ does not prove its existence is not new, of course. Here is a classic statement of a similar argument from BerkeIey’s First Dialogue of Hylas and Philonous:
Hyl.: Do we not perceive the stars and moon, for example, to be a A great way off? Is not this, I say, manifest to the senses? I
diff --git a/docs/codox/TheProblem.html b/docs/codox/TheProblem.html index 00ea801..6811f50 100644 --- a/docs/codox/TheProblem.html +++ b/docs/codox/TheProblem.html @@ -1,6 +1,6 @@ -The Problem Generated by Codox
Wildwood 0.1.0-SNAPSHOT
The Problem
+The Problem Generated by Codox
Wildwood 0.1.0-SNAPSHOT
The Problem
In this chapter talk about the perceived need for expert system explanations. Advance:
the arguments used by expert systems designers, saying why explanations are needed;
the arguments used by critics which claim that the explanations given are not good enough.
diff --git a/docs/codox/index.html b/docs/codox/index.html index 40d1772..2b94155 100644 --- a/docs/codox/index.html +++ b/docs/codox/index.html @@ -1,3 +1,3 @@ -Wildwood 0.1.0-SNAPSHOT Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file +Wildwood 0.1.0-SNAPSHOT
Released under the EPL-2.0 OR GPL-2.0-or-later WITH Classpath-exception-2.0
A general inference library using a game theoretic inference mechanism.
Installation
To install, add the following dependency to your project or build file:
[wildwood "0.1.0-SNAPSHOT"]Topics
- Against Truth
- Analysis
- Arboretum
- Arden
- The Bateson / Kammerer debate
- Bialowieza
- Errata
- Experience
- Hegemonic Argument
- History
- The Huxley / Kropotkin debate
- Implementing
- J'Accuse
- KnacqTools
- Manifesto
- On the First Dialogue of Hylas and Philonous
- On the subtext of a predicate
- The Problem
- Introduction to Wildwood
Namespaces
wildwood.bialowieza
The second iteration of the core inference engine for Wildwood
Public variables and functions:
wildwood.caesar
A dummy set of advocates and knowledge accessors with knowledge about the death of Julius Caesar.
Public variables and functions:
wildwood.dengine.engine
An implementation of the DTree engine adapted to
wildwood.schema
propositions.Public variables and functions:
wildwood.knowledge-accessor
The key point of building Bialowieza as a library rather than a complete application is that it should be possible to hook it up to multiple sources of knowledge. Thus we must design a protocol through which knowledge can be accessed, and a schema in which it will be returned. Note that the accessor must be able to add knowledge to the knowledge base, as well as retrieve it.
Public variables and functions:
wildwood.mongo-ka
A knowledge accessor fetching from and storing to Mongo DB.
Public variables and functions:
wildwood.schema
The knowledge representation. This probably ends up looking a bit like a Toulmin schema, where claims are represented as propositions. There also need to be rules or predicates, things which can test whether a given proposition has a given value. There may be other stuff in here.
Public variables and functions:
Wildwood 0.1.0-SNAPSHOT Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/intro.html b/docs/codox/intro.html index 67b385c..90ec92b 100644 --- a/docs/codox/intro.html +++ b/docs/codox/intro.html @@ -1,6 +1,6 @@ -Wildwood 0.1.0-SNAPSHOT
Released under the EPL-2.0 OR GPL-2.0-or-later WITH Classpath-exception-2.0
A general inference library using a game theoretic inference mechanism.
Installation
To install, add the following dependency to your project or build file:
[wildwood "0.1.0-SNAPSHOT"]Topics
- Against Truth
- Analysis
- Arboretum
- Arden
- The Bateson / Kammerer debate
- Bialowieza
- Errata
- Experience
- Hegemonic Argument
- History
- The Huxley / Kropotkin debate
- Implementing
- J'Accuse
- KnacqTools
- Manifesto
- On the First Dialogue of Hylas and Philonous
- The Problem
- Introduction to Wildwood
Namespaces
wildwood.bialowieza
The second iteration of the core inference engine for Wildwood
Public variables and functions:
wildwood.caesar
A dummy set of advocates and knowledge accessors with knowledge about the death of Julius Caesar.
Public variables and functions:
wildwood.dengine.engine
An implementation of the DTree engine adapted to
wildwood.schema
propositions.Public variables and functions:
wildwood.knowledge-accessor
The key point of building Bialowieza as a library rather than a complete application is that it should be possible to hook it up to multiple sources of knowledge. Thus we must design a protocol through which knowledge can be accessed, and a schema in which it will be returned. Note that the accessor must be able to add knowledge to the knowledge base, as well as retrieve it.
Public variables and functions:
wildwood.mongo-ka
A knowledge accessor fetching from and storing to Mongo DB.
Public variables and functions:
wildwood.schema
The knowledge representation. This probably ends up looking a bit like a Toulmin schema, where claims are represented as propositions. There also need to be rules or predicates, things which can test whether a given proposition has a given value. There may be other stuff in here.
Public variables and functions:
Introduction to Wildwood Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Introduction to Wildwood
+Introduction to Wildwood Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Introduction to Wildwood
I started building Wildwood nearly forty years ago on InterLisp-D workstations. Then, because of changing academic projects, I lost access to those machines, and the project was effectively abandoned. But, I’ve kept thinking about it; it has cool ideas.
Explicable inference
Wildwood was a follow on from ideas developed in Arboretum, an inference system based on a novel propositional logic using defaults. Arboretum was documented in our paper
diff --git a/docs/codox/wildwood.advocate.html b/docs/codox/wildwood.advocate.html index 615150c..2649288 100644 --- a/docs/codox/wildwood.advocate.html +++ b/docs/codox/wildwood.advocate.html @@ -1,6 +1,6 @@ -wildwood.advocate documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.advocate
An agent capable of playing the explanation game.
+wildwood.advocate documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.advocate
An agent capable of playing the explanation game.
An advocate must have its own knowledge accessor. Different advocates within a game may be accessing different knowledge bases, or different subsets of the same knowledge base with different - potentially competing - knowledge. It also needs to know the schema in which knowledge will be presented.
Since the mechanism by which the application will communicate with the library must include a way for users to interact with the game, and since the role of the user in the came is just as a participant, advocate must be defined as a protocol, in order that it may be extended by code within the application which is passed in to the game when the game is started. Indeed, multiple agents - the user(s) and potentially non-player characters - may be passed in.
In this conception, nothing within a default advocate has to be able to produce or consume natural language. It is sufficient for the API exposed by wildwood.advocate to receive and return wildwood.schema objects.
diff --git a/docs/codox/wildwood.bialowieza.html b/docs/codox/wildwood.bialowieza.html index 7980273..08dbe33 100644 --- a/docs/codox/wildwood.bialowieza.html +++ b/docs/codox/wildwood.bialowieza.html @@ -1,6 +1,6 @@ -wildwood.bialowieza documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.bialowieza
The second iteration of the core inference engine for Wildwood
decide
(decide proposition & agents)
Decide the truth value of this
+proposition
by convening a game between these advocateagents
. Iterate the game until all agents PASS; then finally offer each agent’srecord
method theproposition
together with the decided truth value (true
orfalse
), before returning that value.wildwood.bialowieza documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.bialowieza
The second iteration of the core inference engine for Wildwood
decide
(decide proposition & agents)
Decide the truth value of this
proposition
by convening a game between these advocateagents
. Iterate the game until all agents PASS; then finally offer each agent’srecord
method theproposition
together with the decided truth value (true
orfalse
), before returning that value.The
proposition
is a proposition as defined in thewildwood.schema
; that is to say, the predicatewildwood.schema/predicate?
returns true of it. If the proposition isn’t a predicate, throw an exception.Each of
agents
should be an object implementing thewildwood.advocate/Advocate
protocol. If an agent isn’t an Advocate, throw an exception.Do not throw an exception under any other circumstances.
diff --git a/docs/codox/wildwood.caesar.html b/docs/codox/wildwood.caesar.html index be86216..8e89273 100644 --- a/docs/codox/wildwood.caesar.html +++ b/docs/codox/wildwood.caesar.html @@ -1,6 +1,6 @@ -wildwood.caesar documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.caesar
A dummy set of advocates and knowledge accessors with knowledge about the death of Julius Caesar.
+wildwood.caesar documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.caesar
A dummy set of advocates and knowledge accessors with knowledge about the death of Julius Caesar.
The Case Against Marcus Brutus
Did Brutus conspire to kill Caesar in the forum in the Ides of March?
Falco, the detective, must find out.
diff --git a/docs/codox/wildwood.dengine.engine.html b/docs/codox/wildwood.dengine.engine.html index c518b44..b7a6e36 100644 --- a/docs/codox/wildwood.dengine.engine.html +++ b/docs/codox/wildwood.dengine.engine.html @@ -1,3 +1,3 @@ -wildwood.dengine.engine documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file +wildwood.dengine.engine
An implementation of the DTree engine adapted to
wildwood.schema
propositions.decide
(decide proposition node accessor)
Decide the truth value of this
proposition
, using the dtree rooted at thisnode
and knowledge provided by thisaccessor
.wildwood.dengine.engine documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/wildwood.dengine.node.html b/docs/codox/wildwood.dengine.node.html index eecdc84..0d44a39 100644 --- a/docs/codox/wildwood.dengine.node.html +++ b/docs/codox/wildwood.dengine.node.html @@ -1,3 +1,3 @@ -wildwood.dengine.engine
An implementation of the DTree engine adapted to
wildwood.schema
propositions.decide
(decide proposition node accessor)
Decide the truth value of this
proposition
, using the dtree rooted at thisnode
and knowledge provided by thisaccessor
.wildwood.dengine.node documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file +wildwood.dengine.node
A dtree node.
wildwood.dengine.node documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/wildwood.knowledge-accessor.html b/docs/codox/wildwood.knowledge-accessor.html index 108988c..bb77d42 100644 --- a/docs/codox/wildwood.knowledge-accessor.html +++ b/docs/codox/wildwood.knowledge-accessor.html @@ -1,6 +1,6 @@ -wildwood.dengine.node
A dtree node.
wildwood.knowledge-accessor documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.knowledge-accessor
The key point of building Bialowieza as a library rather than a complete application is that it should be possible to hook it up to multiple sources of knowledge. Thus we must design a protocol through which knowledge can be accessed, and a schema in which it will be returned. Note that the accessor must be able to add knowledge to the knowledge base, as well as retrieve it.
Accessor
protocol
members
fetch
(fetch self id)
Fetch all the knowledge I have about the object identified by this
+id
value, as a map whose:id
key has thisid
value.wildwood.knowledge-accessor documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.knowledge-accessor
The key point of building Bialowieza as a library rather than a complete application is that it should be possible to hook it up to multiple sources of knowledge. Thus we must design a protocol through which knowledge can be accessed, and a schema in which it will be returned. Note that the accessor must be able to add knowledge to the knowledge base, as well as retrieve it.
Accessor
protocol
members
fetch
(fetch self id)
Fetch all the knowledge I have about the object identified by this
id
value, as a map whose:id
key has thisid
value.NOTE THAT: I now think knowledge should only be managed at the Wildwood level as sets of propositions, so the idea of bringing back some sort of object representation here is probably wrong.
match
(match self proposition)
Return all the propositions I know which match this proposition. The intended use case here is that you will either supply a fully specified proposition to verify that that proposition is true, or else supply a partially specified proposition to query.
e.g. passing the proposition
{:verb :kill :object :caesar} diff --git a/docs/codox/wildwood.mongo-ka.html b/docs/codox/wildwood.mongo-ka.html index a02b075..ba7509b 100644 --- a/docs/codox/wildwood.mongo-ka.html +++ b/docs/codox/wildwood.mongo-ka.html @@ -1,4 +1,4 @@ -
wildwood.mongo-ka documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.mongo-ka
A knowledge accessor fetching from and storing to Mongo DB.
+wildwood.mongo-ka documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/wildwood.schema.html b/docs/codox/wildwood.schema.html index 9a08179..5bf73c6 100644 --- a/docs/codox/wildwood.schema.html +++ b/docs/codox/wildwood.schema.html @@ -1,6 +1,6 @@ -wildwood.mongo-ka
A knowledge accessor fetching from and storing to Mongo DB.
Hierarchical databases seem a very natural fit for how we’re storing knowledge. Mongo DB seems a particularly natural fit since its internal representation is JSON, which can be transformed to EDN extremely naturally.
wildwood.schema documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.schema
The knowledge representation. This probably ends up looking a bit like a Toulmin schema, where claims are represented as propositions. There also need to be rules or predicates, things which can test whether a given proposition has a given value. There may be other stuff in here.
+wildwood.schema documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
wildwood.schema
The knowledge representation. This probably ends up looking a bit like a Toulmin schema, where claims are represented as propositions. There also need to be rules or predicates, things which can test whether a given proposition has a given value. There may be other stuff in here.
Internal representation of most of this will be as Clojure maps.
argument?
(argument? o)
True if
o
qualifies as an argument structure.An argument structure is a (potentially rich) proposition which, in addition, should have values for
:confidence
and:authority
. A value for:data
may, and probably will, also be present but is not required. The value of:confidence
must be a number in the range -1 to 1.consensual-keys
Every proposition which has these keys, in a given decision process, must have the same semantics and types for their values. The exact representations used for the values of these keys does not matter, it is consensual between all participating advocates in a decision process.
minimise
(minimise o)
Expecting that
o
is a (potentially rich) proposition, return a map identical too
save that for each valuev
of keyk
ino
, ifv
is a map andk
is not a member ofargument-keys
, then the returned map shall substitute the value of(:id v)
.see also
wildwood.knowledge-access/maximise
.proposition?
(proposition? o)
(proposition? o minimised)
True if
o
qualifies as a proposition. A proposition is probably a map with some privileged keys, and may look something like a minimisedthe-great-game.gossip.news-items
item.