Replacing unification by constraint satisfaction to improve logic program expressiveness
From MaRDI portal
Recommendations
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 3965458 (Why is no real title available?)
- scientific article; zbMATH DE number 3978432 (Why is no real title available?)
- scientific article; zbMATH DE number 4049155 (Why is no real title available?)
- scientific article; zbMATH DE number 2166303 (Why is no real title available?)
- scientific article; zbMATH DE number 4185011 (Why is no real title available?)
- Negation and control in PROLOG
Cited in
(8)- Using an extended PROLOG to solve the lion and unicorn Puzzle
- scientific article; zbMATH DE number 3921947 (Why is no real title available?)
- scientific article; zbMATH DE number 4078850 (Why is no real title available?)
- scientific article; zbMATH DE number 1759716 (Why is no real title available?)
- scientific article; zbMATH DE number 4113971 (Why is no real title available?)
- Selective Unification in (Constraint) Logic Programming*
- Constrained equational deduction
- Symbolic constraint handling through unification in finite algebras
This page was built for publication: Replacing unification by constraint satisfaction to improve logic program expressiveness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912656)