SETL

swMATH36325MaRDI QIDQ52027FDOQ52027

Author name not available (Why is that?)

Cited In (26)

• Orthogonal parallel processing in Vector Pascal
• Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
• Title not available (Why is that?)
• Set graphs. IV. Further connections with claw-freeness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using multiset discrimination to solve language processing problems without hashing
• Interval propagation to reason about sets: Definition and implementation of a practical language
• A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case
• Title not available (Why is that?)
• Adding partial functions to Constraint Logic Programming with sets
• Automated proof of Bell-LaPadula security properties
• Set graphs. II. Complexity of set graph recognition and similar problems
• POETS: process-oriented event-driven transaction systems
• A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
• Comprehending Ringads
• Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
• An automatically verified prototype of the Tokeneer ID station specification
• Issues in commonsense set theory
• The foundation of self-developing blob machines for spatial computing
• Automated reasoning with restricted intensional sets
• Goals and benchmarks for automated map reasoning
• Finding Reductions Automatically
• Quantum interference computation
• An NSF proposal
• Transformational derivation of an improved alias analysis algorithm

This page was built for software: SETL