Inference planning using digraphs and Boolean arrays

Authors:
J. Jantzen
Affiliations:
Technical University of Denmark, Electric Power Eng. Dept., DK-2800 Lyngby, DENMARK
Venue:
APL '89 Conference proceedings on APL as a tool of thought
Year:
1989

Citing 1
Cited 7

Boolean array structures for a rule-based forward chaining inference engine

APL '87 Proceedings of the international conference on APL: APL in transition

A structured approach to analysis and design of complex systems

APL '90 Conference proceedings on APL 90: for the future
DSS structure and algorithmic transparency in APL

APL '91 Proceedings of the international conference on APL '91
Using boolean of integer arrays to analyze networks

APL '91 Proceedings of the international conference on APL '91
A bibliography of APL articles on modeling and KBES

ACM SIGAPL APL Quote Quad
Finding circular relationships in networks

ACM SIGAPL APL Quote Quad
Graphical representation of defeasible logic rules using digraphs

SETN'06 Proceedings of the 4th Helenic conference on Advances in Artificial Intelligence
Visualizing defeasible logic rules for the semantic web

ASWC'06 Proceedings of the First Asian conference on The Semantic Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

The study applies digraph techniques to a paper on Boolean array structures in rule bases. The rule base is mapped into a digraph, represented by Boolean matrices. Techniques for computing reachability, and for finding the firing order of rules using level codes are given in the Nested Interactive Array Language (Nial). The digraph approach leads to a number of tests for consistency.