A logic you can count on
DOI10.1145/964001.964013zbMath1325.03032MaRDI QIDQ3452257
Silvano Dal Zilio, Denis Lugiez, Charles Meyssonnier
Publication date: 11 November 2015
Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/964001.964013
ambient; substructural logic; tree automata; Presburger arithmetic; semi-structured data; model checking satisfiability
68Q45: Formal languages and automata
03B70: Logic in computer science
03D05: Automata and formal grammars in connection with logical questions
68Q60: Specification and verification (program logics, model checking, etc.)
03B25: Decidability of theories and sets of sentences
Related Items