A kind of logical compilation for knowledge bases

DOI10.1016/0304-3975(94)90095-7zbMath0813.68155OpenAlexW2075057025MaRDI QIDQ1331921

Jean-Paul Delahaye, Philippe Mathieu

Publication date: 29 August 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90095-7

zbMATH Keywords

expert systemsincremental compilationforward chaining algorithmlogical compilation

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic programming (68N17)

Related Items (3)

A new method for knowledge compilation: The achievement by cycle search ⋮ Exact knowledge compilation in predicate calculus: The partial achievement case ⋮ The achievement of knowledge bases by cycle search.

Cites Work

• Programming in three-valued logic
• Probabilistic approach to the satisfiability problem
• The intractability of resolution
• Linear resolution for consequence finding
• Counting the number of solutions for instances of satisfiability
• A kripke-kleene semantics for logic programs*
• Negation in logic programming
• On Matrices with Connections
• The relative efficiency of propositional proof systems
• A Computing Procedure for Quantification Theory
• The Specialization of Programs by Theorem Proving
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A kind of logical compilation for knowledge bases