Reducing Equational Theories for the Decision of Static Equivalence

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-10622-4_8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Reducing Equational Theories for the Decision of Static Equivalence

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2010English

Decision Problems for Equational Theories of Relation Algebras

Memoirs of the American Mathematical Society
MathematicsApplied Mathematics
1997English

Equational Theories and Database Constraints

1985English

Equational Binary Decision Diagrams

English

Linear Equational Theories and Semimodule Representations

International Journal of Algebra and Computation
Mathematics
1998English

Set Constraints in Some Equational Theories

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1998English

Equational Theories and Monads From Polynomial Cayley Representations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Combining Equational Tree Automata Over AC and ACI Theories

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Equivalence of Lattice Gauge and Spin Theories

Physics Letters, Section B: Nuclear, Elementary Particle and High-Energy Physics
High Energy PhysicsNuclear
1983English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy