kd24.dat -- example knowledge-base file
[Functional Description of the Software]
While hypothetical reasoning ( or abduction) is an important framework
for knowledge
systems applicable to many problems including diagnosis,
design, etc., it takes exponential time for a given problem size
to find an exact solution. This NBP1 software provides a fast
cost-based (or weighted) hypothetical reasoning system, which can
compute a near-optimal solution in low-order polynomial time.
Here, the cost of a solution is the sum of numerical weights assigned to
element hypotheses included in the solution, and the optimal solution
means that the cost is minimal. The fast reasoning mechanism of this
system is based on the networked bubble propagation method, which has
been derived as an improvement on the pivot-and-complement method,
an efficient approximate solution method for 0-1 integer programming.
Experimental speed perfermance shows a polynomial time of approximately
1.5 power of N, where N is the number of possible element hypotheses
in the knowledge base.
The software is equipped with a graphical user interface using X-windows.
[References]
- Y. Ohsawa and M. Ishizuka: A Polynomial-time Predicate-logic
Hypothetical Reasoning by Networked Bubble Propagation Method,
Proc. Canadian Conf. on AI, Toronto, pp.375-387 (1996).
- Y. Ohsawa and M. Ishizuka: Networked Bubble Propagation Method
as a Polynonmial-time Hypothetical Reasoning for Computing
Near-optimal Solution, to appear, Artificial Intelligence (1996).
[User's Manual]
How to install the program
- Compile the source program (nbp1.c) in a Unix environment with
an X-windows library as follows to produce an executable program.
gcc nbp1.c -L(the directory containing tk and tcl) -ltk -ltcl
[ -L(the directory containing X11 and m) -I(the directory containing the
included files of X) ] -lX11 -lm
How to operate on the X-window
- If you run the program, it can be operated from the X-windows'
graphical interface by the following operations.
- 'File' Pull-down Menu
- 'Edit' (to open an edit window for a knowledge base)
- 'Quit' (quit the program)
- 'Option' Pull-down Menu
- Select from the following operation modes.
- non-stop (continuous operation; default mode)
- step-by-step (stepwise operation)
- Editing Display Window: edit the knowledge base and execute
hypothetical reasoning.
- 'Open' menu: open a window to enter the file name of
a knowledge base
- 'Start' nemu: execute hypothetical reasoning (NBP method)
on the file before editing
- 'Test' menu: execute hypothetical reasoning (NBP method)
on the file after editing
- 'Save' menu: save the edited file
- 'Quit' nemu: quit the editing window
Format of knowledge-base file
- This ia a tentative version for experiments; revisions are planned.
Because of the tentative version, a simple symbol "-" is used for
representing ":-" widely used in Prolog. Also, ",(return)" is used to
indicate the separation between clauses as exemplified below.
The weight of each element hypothesis will be set to the default value '1'
in this version. 'True' and 'False' are expressed as '1' and '0',
respectively.
The following shows examples of the knowledge format.
- {an example of goal for hypothetical reasoning}
- 1-g,
- {an example of rule-type propositional clause}
- a-b,h1,
- {an example of constraint knowledge indicating inconsistency relation}
- 0-h1,h2,
- {an example of knowledge-base file -- kb2.dat}
- 1-g,
- g-ma0,md0,
- ma0-mb0,
- ma0-mc0,
- ma0-hc0,
- md0-ha0,
- md0-hb0,
- mb0-he0,
- mc0-me0,
- me0-hd0,
- 0-ha0,he0,
- 0-hb0,he0,
- 0-ha0,hd0,
- 0-hb0,hd0,
- 0-ha0,hc0,
- {the following files are attached for trial use;
-- kb8.dat kb20.dat kb22.dat kb23.dat kb24.dat }
[Others]
A predicate-logic version will be released later.
You can see the home page of
Ishizuka Lab.
at Dept. of Information and Communication Eng., Faculty of Eng.,
University of Tokyo.
[FTP]
- README
- Program and Documents in Japanese [27K]
www-admin@icot.or.jp