Finding models through graph saturation

DOI10.1016/j.jlamp.2018.06.005zbMath1401.68043arXiv1806.09392OpenAlexW2810635987WikidataQ120483276 ScholiaQ120483276MaRDI QIDQ1785854

Sebastiaan J. C. Joosten

Publication date: 1 October 2018

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.09392

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• Alloy
• Alcoa
• Z
• Ampersand

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relation algebras: Concept of points and representability
• Data Complexity in the $\mathcal{EL}$ Family of Description Logics
• Parsing and Printing of and with Triples
• Software Development in Relation Algebra with Ampersand
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: Finding models through graph saturation