Symbolic constraint handling through unification in finite algebras
- 1 September 1990
- journal article
- research article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 1 (2) , 97-118
- https://doi.org/10.1007/bf01810294
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The notion of proof in hardware verificationJournal of Automated Reasoning, 1989
- IMPLEMENTING COMPLEX DOMAINS OF APPLICATION IN AN EXTENDED PROLOG SYSTEMInternational Journal of General Systems, 1989
- Embedding boolean expressions into logic programmingJournal of Symbolic Computation, 1987
- Fast Methods for Switch-Level Verification of MOS CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Pseudo-Boolean Logic CircuitsIEEE Transactions on Computers, 1986
- A qualitative physics based on confluencesArtificial Intelligence, 1984
- Constraints—A language for expressing almost-hierarchical descriptionsArtificial Intelligence, 1980
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysisArtificial Intelligence, 1977
- A Short Course on Error Correcting CodesPublished by Springer Nature ,1975