Replacing unification by constraint satisfaction to improve logic program expressiveness

DOI10.1007/BF00302641zbMath0698.68082MaRDI QIDQ912656

N. E. Zubov

Publication date: 1990

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

resolutionconstraint satisfaction algorithmPrologconstrained unification

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (1)

Constrained equational deduction

Uses Software

• LINPACK

Cites Work

• Negation and control in PROLOG
• Gaussian elimination is not optimal
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Replacing unification by constraint satisfaction to improve logic program expressiveness