Exact knowledge compilation in predicate calculus: the partial achievement case
From MaRDI portal
Recommendations
Cites work
- A kind of logical compilation for knowledge bases
- A Machine-Oriented Logic Based on the Resolution Principle
- A new method for knowledge compilation: The achievement by cycle search
- Exact knowledge compilation in predicate calculus: the partial achievement case
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- scientific article; zbMATH DE number 549989 (Why is no real title available?)
- scientific article; zbMATH DE number 714922 (Why is no real title available?)
- scientific article; zbMATH DE number 1059316 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (Why is no real title available?)
- Knowledge compilation and theory approximation
- Poincaré series for discrete Moebius groups acting on the upper half space
Cited in
(6)- The achievement of knowledge bases by cycle search.
- Forward chaining is simple\((x)\)
- Canonical Inference for Implicational Systems
- Optimizing general chain programs
- scientific article; zbMATH DE number 1059316 (Why is no real title available?)
- Exact knowledge compilation in predicate calculus: the partial achievement case
This page was built for publication: Exact knowledge compilation in predicate calculus: the partial achievement case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5234699)