Against Truth
+Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Against Truth
“Hey, what IS truth, man?” Beeblebrox, Z, quoted in [Adams, 1978]
@@ -22,6 +22,9 @@The Problem History Analysis +On Hegemonic Argument +The Huxley/Kropotkin debate +The Bateson/Kammerer debate Part Two: Into the wild wood
@@ -32,8 +35,9 @@
-- Implementing
- Experience
Endmatter
+Endmatter: bringing it all together
diff --git a/docs/codox/Analysis.html b/docs/codox/Analysis.html index 7a4f14b..c48c135 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: ,
@@ -322,11 +322,17 @@ a is x
as a good explanation for the occurance of the same phenomenon. He would know perfectly well that the earth, being fixed, could not rotate on its axis. And even if it could, why should this influence the daily ritual of Ra?
We consider an explanation good if it maps a statement about the explicandum onto the theory, or body of belief, which we currently hold.
[Main text of argument. In the tradition of ‘philosophy of science’ I intend to draw on examples from two genuine debates, drawn in this instance from the development of the theory of evolution. These debates are
-The debate between Huxley and Kropotkin over whether co-operation or competition was the more important factor in the survival of species.
-Kropotkin, a leading Anarchist, sought to show that human beings (among other animals) were inherently co-operative, and (implied conclusion) would get along fine in the absence of government. Huxley, a Tory, sought to show that, on the contrary, competition (and, implicitly, capitalism) red in tooth and claw was ‘natural’.
-The debate between Bateson and Kammerer over whether acquired characteristics were inherited.
-Kammerer, then the only scientist capable of breeding many species of amphibian in captivity, showed in a series of experiments that characteristics aquired by parents were inherited by their offspring. Bateson, in a series of increasingly virulent attacks, ultimately claimed that these experiments were fraudulent. As no-one else was even capable of breeding the creatures involved, they could not be repeated.
-Kammerer was a communist, and the implicit argument behind his work was that human beings were perfectable; that some parts of the benefits of humane education and culture would be transmitted. Bateson was again a Tory, though not as politically committed as the other figures discussed.
++The debate between Huxley and Kropotkin over whether co-operation or competition was the more important factor in the survival of species.
+++Kropotkin, a leading Anarchist, sought to show that human beings (among other animals) were inherently co-operative, and (implied conclusion) would get along fine in the absence of government. Huxley, a Tory, sought to show that, on the contrary, competition (and, implicitly, capitalism) red in tooth and claw was ‘natural’.
+The debate between Bateson and Kammerer over whether acquired characteristics were inherited.
+++Kammerer, then the only scientist capable of breeding many species of amphibian in captivity, showed in a series of experiments that characteristics aquired by parents were inherited by their offspring. Bateson, in a series of increasingly virulent attacks, ultimately claimed that these experiments were fraudulent. As no one else was even capable of breeding the creatures involved, the experiments could not be repeated.
+Kammerer was a communist, and the implicit argument behind his work was that human beings were perfectable; that some parts of the benefits of humane education and culture would be transmitted. Bateson was again a Tory, though not as politically committed as the other figures discussed.
+In these debates it is clear that the protagonists sought ot explain a phenomenon - in this case evolution - in terms of theories which supported their own views of the world. The act of explanation was clearly being used as a polemic act, to try to pursuade the explainee of the correctness of the explainers ideological stance]
Acknowledgments
I am grateful to Vernon Pratt for helping me clarify the consequences that this doctrine has for the concepts of ‘theory’ and ‘belief’. lf it is the case that there is no access to a ‘real world’, then all statements about the nature of the world are of equal - undifferentiable - validity (except in so far as some aesthetic criteria may be applied to them). It remains possible to differentiate between a belief - an unsupported statement about the nature of the world - and a theory: a statement that the world has some property as a consequence of certain other properties which it may have. However, it seems to me that this distinction is of little practical importance.
diff --git a/docs/codox/Arboretum.html b/docs/codox/Arboretum.html index a19e585..2d44c29 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 0a597df..e0e1316 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 new file mode 100644 index 0000000..f3442ed --- /dev/null +++ b/docs/codox/BatesonKammerer.html @@ -0,0 +1,4 @@ + +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 df793d9..5e46015 100644 --- a/docs/codox/Bialowieza.html +++ b/docs/codox/Bialowieza.html @@ -1,7 +1,7 @@ -Bialowieza Generated by Codox
Wildwood 0.1.0-SNAPSHOT
Bialowieza
-{ this chapter is in active development }
+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.
Motivation
@@ -50,7 +50,7 @@- that
:truthand:confidenceare bothqualifiersof the claim in the sense of the Q term;- that
-:authorityis a form ofbackingin the sense of the B term.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 data is not minimised.
+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
:datakey is not minimised.Proposition minimisation
How are the values of
:subject,:objectand so on to be passed? If we pass rich knowledge structures around, then we lose the insight that different advocates may know different things about given objects. Thus, while internally within each advocate’s knowledge base objects may be stored with rich data, when they’re passed around in propositions they should be minimised - that is to say, the value should just be a unique identifier, such that, for every object in the domain, if an advocate knows anything at all about that object, it knows its unique identifier and knows the object by that unique identifier.Thus the unique identifier has something of the nature of a ‘true name’, in the magical sense. A given true name, a given unique identifier, refers to precisely one thing in the world, and provided that two advocates both know the same true name, they can debats propositions which refer to the object with that true name.
@@ -62,7 +62,7 @@The object of building Bialowieza as a library is that we should not constrain how applications which use the library store their knowledge. Rather, knowledge accessors must transduce between the representation used by the particular storage implementation and that defined in
wildwood.schema. However, what we’ve described above suggests that a hierarchical database would be a very natural fit for knowlege base data - more natural, in this case, than a relational database.Prejudice, and defaults
In Arboretum and later in KnacqTools, default values of features were determined by the ‘knowledge engineer’, normally by asking the domain expert, and were fixed for the knowledge base at all times. But these two programs each reasoned about one case at a time, and did not store knowledge about multiple cases.
-These systems could this be said to be prejudiced, to the extent that knowledge of the world acquired over time did not change their default judgements. Wildwood holds knowledge on potentially very many objects, and that knowledge may change dynamically over time, both as the world changes and as new things which already existed in the world become known.
+These systems could thus be said to be prejudiced, to the extent that knowledge of the world acquired over time did not change their default judgements. Wildwood holds knowledge on potentially very many objects, and that knowledge may change dynamically over time, both as the world changes and as new things which already existed in the world become known.
Suppose we wish to decide the truth value of the proposition
diff --git a/docs/codox/Errata.html b/docs/codox/Errata.html index a16b6c0..8681c93 100644 --- a/docs/codox/Errata.html +++ b/docs/codox/Errata.html @@ -1,6 +1,6 @@ -{:verb :is :subject :brutus :object :honourable}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 b6762e3..1fd834f 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 new file mode 100644 index 0000000..4bd86f4 --- /dev/null +++ b/docs/codox/HegemonicArgument.html @@ -0,0 +1,4 @@ + +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 afd3e1c..8362c58 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 new file mode 100644 index 0000000..76be802 --- /dev/null +++ b/docs/codox/HuxleyKropotkin.html @@ -0,0 +1,4 @@ + +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 8ea5e4d..3e3f9fe 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 new file mode 100644 index 0000000..c260194 --- /dev/null +++ b/docs/codox/JAccuse.html @@ -0,0 +1,6 @@ + +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 87d8478..431b068 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 02550c3..9aa9fab 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 3efb113..b26bca7 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/PredicateSubtext.html b/docs/codox/PredicateSubtext.html index b4f9e85..9b5d320 100644 --- a/docs/codox/PredicateSubtext.html +++ b/docs/codox/PredicateSubtext.html @@ -1,6 +1,6 @@ -On the subtext of a predicate Generated by Codox
Wildwood 0.1.0-SNAPSHOT
On the subtext of a predicate
+On the subtext of a predicate Generated by Codox
Wildwood 0.1.0-SNAPSHOT
On the subtext of a predicate
Predicates are not atomic. They do not come single spies, but freighted with battalions of inferable subtexts. Suppose Anthony says
diff --git a/docs/codox/TheProblem.html b/docs/codox/TheProblem.html index 3962a2f..6d365b2 100644 --- a/docs/codox/TheProblem.html +++ b/docs/codox/TheProblem.html @@ -1,6 +1,6 @@ -Brutus killed Caesar in Rome during the ides of MarchThe 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 ae239a3..b3fbab8 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
- Bialowieza
- Errata
- Experience
- History
- Implementing
- 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.schemapropositions.Public variables and functions:
wildwood.dengine.engine
An implementation of the DTree engine adapted to
wildwood.schemapropositions.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.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 9a8690d..42ae7d2 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
- 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.schemapropositions.Public variables and functions:
wildwood.dengine.engine
An implementation of the DTree engine adapted to
wildwood.schemapropositions.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.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 4761bba..b3e6a19 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 f19a5d4..1e031bf 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
+propositionby convening a game between these advocateagents. Iterate the game until all agents PASS; then finally offer each agent’srecordmethod thepropositiontogether with the decided truth value (trueorfalse), 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
propositionby convening a game between these advocateagents. Iterate the game until all agents PASS; then finally offer each agent’srecordmethod thepropositiontogether with the decided truth value (trueorfalse), before returning that value.The
propositionis 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
agentsshould be an object implementing thewildwood.advocate/Advocateprotocol. 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 be7a70b..1866fbd 100644 --- a/docs/codox/wildwood.caesar.html +++ b/docs/codox/wildwood.caesar.html @@ -1,3 +1,3 @@ -wildwood.caesar documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file +wildwood.caesar
A dummy set of advocates and knowledge accessors with knowledge about the death of Julius Caesar.
drusila-kb
Drusila knows that Longus killed Caesar in the forum. She keys it on all three, for efficiency of retrieval.
wildwood.caesar documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file diff --git a/docs/codox/wildwood.dengine.engine.html b/docs/codox/wildwood.dengine.engine.html index fc2a9f5..ae4ee31 100644 --- a/docs/codox/wildwood.dengine.engine.html +++ b/docs/codox/wildwood.dengine.engine.html @@ -1,3 +1,3 @@ -wildwood.caesar
A dummy set of advocates and knowledge accessors with knowledge about the death of Julius Caesar.
drusila-kb
Drusila knows that Longus killed Caesar in the forum. She keys it on all three, for efficiency of retrieval.
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.schemapropositions.decide
(decide proposition node accessor)Decide the truth value of this
proposition, using the dtree rooted at thisnodeand 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.knowledge-accessor.html b/docs/codox/wildwood.knowledge-accessor.html index 0f836e3..3995ba5 100644 --- a/docs/codox/wildwood.knowledge-accessor.html +++ b/docs/codox/wildwood.knowledge-accessor.html @@ -1,3 +1,3 @@ -wildwood.dengine.engine
An implementation of the DTree engine adapted to
wildwood.schemapropositions.decide
(decide proposition node accessor)Decide the truth value of this
proposition, using the dtree rooted at thisnodeand knowledge provided by thisaccessor.wildwood.knowledge-accessor documentation Generated by Codox
Wildwood 0.1.0-SNAPSHOT
\ No newline at end of file +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
idvalue, as a map whose:idkey has thisidvalue.store
(store self id proposition)Add this
propositionto the knowledge I hold about the object identified by thisidvalue.wildwood.knowledge-accessor 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 5cf126f..d420064 100644 --- a/docs/codox/wildwood.schema.html +++ b/docs/codox/wildwood.schema.html @@ -1,6 +1,6 @@ -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
idvalue, as a map whose:idkey has thisidvalue.store
(store self id proposition)Add this
propositionto the knowledge I hold about the object identified by thisidvalue.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
oqualifies as an argument structure.An argument structure is a (potentially rich proposition which, in addition, should have values for
:confidenceand:authority. A value for:datamay, and probably will, also be present but is not required.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
ois a (potentially rich) proposition, return a map identical toosave that for each valuevof keykino, ifvis a map andkis 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
oqualifies as a proposition. A proposition is probably a map with some privileged keys, and may look something like a minimisedthe-great-game.gossip.news-itemsitem.
