A decision procedure for semantical equivalence of thin FM specifications

DOI10.1016/S0022-4049(99)00120-6zbMATH Open0937.18008WikidataQ127740920 ScholiaQ127740920MaRDI QIDQ1818643FDOQ1818643

Eric Steegmans, Frank Piessens

Publication date: 30 May 2000

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Recommendations

• Equivalence of formal semantics definition methods
• Equivalence of two formal semantics for functional logic programs
• Equivalence of recursive specifications in process algebra
• A procedure for deciding symbolic equivalence between sets of constraint systems
• Proving semantical equivalence of data specifications
• scientific article; zbMATH DE number 1735627
• A reduced semantics for deciding trace equivalence
• Fuzzy inference in a formal theory of semantic equivalence
• Declarative and procedural semantics of fuzzy similarity based unification

zbMATH Keywords

undecidabilityrelational databasespecification logicmetafinite structuressemantical equivalencesketch-based data specifications

Mathematics Subject Classification ID

Database theory (68P15) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Categorical semantics of formal languages (18C50) Semantics in the theory of computing (68Q55) Functor categories, comma categories (18A25) Epimorphisms, monomorphisms, special classes of morphisms, null morphisms (18A20) Foundations, relations to logic and deductive systems (18A15)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: A decision procedure for semantical equivalence of thin FM specifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818643)