Reasoning with first order nondeterministic specifications

DOI10.1007/S002360050165MaRDI QIDQ1806174zbMATH OpenOpenAlexFDO

Authors Beata Konikowska, Marcin Białasik

Publication date 1 November 1999

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

multi-sorted algebras

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1303442
• Quantifier-free logic for nondeterministic theories
• Nondeterministic algebraic specifications and nonconfluent term rewriting
• scientific article; zbMATH DE number 234027

Cited in

(10)

• A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
• Rasiowa-Sikorski deduction systems in computer science applications.
• Quantifier-free logic for nondeterministic theories
• scientific article; zbMATH DE number 3978366 (Why is no real title available?)
• scientific article; zbMATH DE number 1303442 (Why is no real title available?)
• scientific article; zbMATH DE number 1487474 (Why is no real title available?)
• Quantifier-free logic for multialgebraic theories
• Generated models and the -rule: the nondeterministic case
• scientific article; zbMATH DE number 5244180 (Why is no real title available?)
• A reasoning system for satisfiability of diagrammatic specifications

This page was built for publication: Reasoning with first order nondeterministic specifications

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