Symbolic constraint handling through unification in finite algebras
type: Item
instance of: scholarly article
title: Symbolic constraint handling through unification in finite algebras
zbMATH Open document ID: 0723.68051
DOI: 10.1007/BF01810294
author: Klaus Estenfeld
author: Richard Schmid
author: Hans-Albert Schneider
author: Erik Tidén
author: Wolfram Buettner
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 4193120
zbMATH Keywords: constraint satisfaction problem
zbMATH Keywords: finite algebras
zbMATH Keywords: unification
zbMATH Keywords: Prolog
MaRDI profile type: Publication
cites work: Q4083730
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: IMPLEMENTING COMPLEX DOMAINS OF APPLICATION IN AN EXTENDED PROLOG SYSTEM
cites work: Q3818293
cites work: Embedding Boolean expressions into logic programming
cites work: The notion of proof in hardware verification
cites work: Extended unification algorithms for the integration of functional programming into logic programming
cites work: Solving large combinatorial problems in logic programming
cites work: Q5459443
cites work: Pseudo-Boolean Logic Circuits
cites work: FM8501: a verified microprocessor
cites work: Q3789063
cites work: Q5678447
cites work: Q4087064
cites work: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
full work available at URL: https://doi.org/10.1007/bf01810294
OpenAlex ID: W2075361878
description: scientific article; zbMATH DE number 4193120