The achievement of knowledge bases by cycle search.

DOI10.1006/inco.1999.2851zbMath1045.68604OpenAlexW2081500090MaRDI QIDQ1854365

Philippe Mathieu, Olivier Roussel

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/77c413f315a15f529efe290be0b74a3ac842ce94

zbMATH Keywords

forward chaininginference systems

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (1)

Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes

Cites Work

• A kind of logical compilation for knowledge bases
• A Proof Procedure Using Connection Graphs
• A new method for knowledge compilation: The achievement by cycle search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The achievement of knowledge bases by cycle search.