Symbolic constraint handling through unification in finite algebras

DOI10.1007/BF01810294zbMath0723.68051OpenAlexW2075361878MaRDI QIDQ757060

Erik Tidén, Klaus Estenfeld, Richard Schmid, Hans-Albert Schneider, Wolfram Buettner

Publication date: 1990

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01810294

zbMATH Keywords

unificationconstraint satisfaction problemPrologfinite algebras

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (1)

Many-valued logic and mixed integer programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding Boolean expressions into logic programming
• The notion of proof in hardware verification
• Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
• FM8501: a verified microprocessor
• Pseudo-Boolean Logic Circuits
• Graph-Based Algorithms for Boolean Function Manipulation
• Extended unification algorithms for the integration of functional programming into logic programming
• IMPLEMENTING COMPLEX DOMAINS OF APPLICATION IN AN EXTENDED PROLOG SYSTEM
• Solving large combinatorial problems in logic programming

This page was built for publication: Symbolic constraint handling through unification in finite algebras