scientific article; zbMATH DE number 7552282
DOI10.13137/2464-8728/33309zbMATH Open1490.68079arXiv2104.08130MaRDI QIDQ5087785FDOQ5087785
Authors: Maximiliano Cristiá, Gianfranco Rossi 
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2104.08130
Title of this publication is not available (Why is that?)
Recommendations
- {log}: A language for programming in logic with finite sets
- Logic programming and logarithmic space
- From formulas to cirquents in computability logic
- scientific article; zbMATH DE number 1368923
- THE Σλ-CALCULUS AND DERIVED PROGRAM FORMS
- Algebra and Coalgebra in Computer Science
- A program transformation from equational programs into logic programs
- scientific article
- Logic Programs for Primitive Recursive Sets
- The satisfiability of logical formula in proof of program
Theory of programming languages (68N15) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Other classical set theory (including functions, relations, and set algebra) (03E20) Applications of set theory (03E75) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- {log}: A language for programming in logic with finite sets
- Title not available (Why is that?)
- The calculus of constructions
- A pearl on SAT and SMT solving in Prolog
- Solving quantifier-free first-order constraints over finite sets and binary relations
- Proofs as programs
- Title not available (Why is that?)
- Abstract state machines, Alloy, B, TLA, VDM, and Z. 6th international conference, ABZ 2018, Southampton, UK, June 5--8, 2018. Proceedings
- Efficient automated reasoning about sets and multisets with cardinality constraints
- A set solver for finite set relation algebra
- Cardinality constraints for arrays (decidability results and applications)
- Automated proof of Bell-LaPadula security properties
- A decision procedure for restricted intensional sets
- Set unification
- An automatically verified prototype of the Tokeneer ID station specification
- Automated reasoning with restricted intensional sets
- A decision procedure for sets, binary relations and partial functions
- A complete and terminating approach to linear integer solving
- Title not available (Why is that?)
Cited In (6)
- Title not available (Why is that?)
- A set solver for finite set relation algebra
- LOIS: syntax and semantics
- CLAIRE: combining sets, search and rules to better express algorithms
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers
- MUNCH -- automated reasoner for sets and multisets
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087785)
