On the graph traversal method for evaluating linear binary-chain programs
From MaRDI portal
Publication:5926750
DOI10.1007/BF02916768zbMath0971.68160OpenAlexW1983725450MaRDI QIDQ5926750
Publication date: 7 March 2001
Published in: Science in China. Series E (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02916768
Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Cites Work
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for finding all feedback vertices
- On the power of magic
- Efficient evaluation for a subset of recursive queries
- On compiling queries in recursive first-order databases
- Graphic representation of linear recursive rules
- Abstract interpretation based on oldt resolution
- On the bottom-up evaluation of recursive queries
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: On the graph traversal method for evaluating linear binary-chain programs