Toupie: The -calculus over finite domains as a constraint language

DOI10.1023/A:1005732517165MaRDI QIDQ1369077zbMATH OpenFDO

Authors Marc-Michel Corsini, A. Rauzy

Publication date 12 April 2000

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1005732517165

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited in

(1)

• On temporal logic versus Datalog

This page was built for publication: Toupie: The \(\mu\)-calculus over finite domains as a constraint language

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