Replacing unification by constraint satisfaction to improve logic program expressiveness

DOI10.1007/BF00302641zbMATH Open0698.68082MaRDI QIDQ912656FDOQ912656

Authors: N. E. Zubov 

Publication date: 1990

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

Recommendations

• scientific article; zbMATH DE number 4058908
• scientific article; zbMATH DE number 4113971
• scientific article; zbMATH DE number 4078850
• Symbolic constraint handling through unification in finite algebras
• A resolution principle for constrained logics

zbMATH Keywords

resolutionPrologconstrained unificationconstraint satisfaction algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Gaussian elimination is not optimal
• A Machine-Oriented Logic Based on the Resolution Principle
• Title not available (Why is that?)
• Negation and control in PROLOG
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• Selective Unification in (Constraint) Logic Programming*
• Using an extended PROLOG to solve the lion and unicorn Puzzle
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constrained equational deduction
• Title not available (Why is that?)

Uses Software

• LINPACK

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)