yusuke1997/dblp-id-title huggingface dataset:
Coloring Sparse Random k -Colorable Graphs in Polynomial Expected Time
On Models of Protection in Operating Systems
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits
Minimizing Variants of Visibly Pushdown Automata
Causal Testing
Temporal Logics for Multi-Agent Systems (Invited Talk)
Oracle Branching Programs and Logspace versus P
Simulating 3D Cellular Automata with 2D Cellular Automata
Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games
On Maximal Prefix Sets of Words
Monoids of Upper Triangular Matrices over the Boolean Semiring
Do We Really Understand the Crossing Numbers?
Encoding the Hydra Battle as a Rewrite System
Continuous Rational Functions Are Deterministic Regular
A Reduct-and-Closure Algorithm for Graphs
A Note on Unique Decipherability
Microprogram-Oriented Model of the Controlled Structure
The Complexity of Periodic Energy Minimisation
Dispersing Obnoxious Facilities on Graphs by Rounding Distances
On the Complexity of Team Logic and Its Two-Variable Fragment
An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture
Recovering Sparse Graphs
Computational Complexity of Smooth Differential Equations
An Algebraic Theory of Formal Languages
Equitable Colorings of Bounded Treewidth Graphs
Factorizing Codes and Schützenberger Conjectures
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete
Some Meet-in-the-Middle Circuit Lower Bounds
More on Weighted Servers or FIFO is Better than LRU
Branching Programs for Tree Evaluation
On Counting AC 0 Circuits with Negative Constants
The Prize-Collecting Edge Dominating Set Problem in Trees
Initially-Restricting Algebraic Theories
Quick Separation in Chordal and Split Graphs
ACID-Unification Is NEXPTIME-Decidable
Some Typical Properties of Large AND/OR Boolean Formulas
The Medial Axis of a Simple Polygon
Ignoring Nonessential Interleavings in Assertional Reasoning on Concurrent Programs
(Un)Decidability for History Preserving True Concurrent Logics
Prior-Free Auctions of Digital Goods
Complexity of E0L Structural Equivalence
Fractal Intersections and Products via Algorithmic Dimension
Factoring Multivariate Polynomials over Algebraic Number Fields
Complexity Results for Confluence Problems
A Circuit Complexity Approach to Transductions
A Perfect Parallel Dictionary
Tight Analysis of the Primal-Dual Method for Edge-Covering Pliable Set Families
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
Categories of Coalgebraic Games
Sampling Edge Covers in 3-Regular Graphs
Classification of the Context-Free Languages
Probabilistic Combinatorial Optimization
The Effective Arrangement of Logical Systems
Competitive Analysis of On-line Stream Merging Algorithms
Equality, Revisited
Context-Free-Like Forms for the Phrase-Structure Grammars
Matrix Systems and Principal Cones of Algebraic Power Series
Polynomial-Time Functions Generate SAT: On P-Splinters
Quantum-Inspired Classical Algorithms for Singular Value Transformation
Efficient Unidimensional Universal Cellular Automaton
On the Parsing of LL-Regular Grammars
On Generalized Words of Thue-Morse
Recognizing H-Graphs - Beyond Circular-Arc Graphs
The Complexity of Approximating the Complex-Valued Potts Model
Online Algorithms for Disk Graphs
forall exists*-Equational Theory of Context Unification is Pi 1 0 -Hard
Bounds on Non-surjective Cellular Automata
Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations
Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract)
Retraceability, Repleteness and Busy Beaver Sets
Feasible Combinatorial Matrix Theory
The Relationship between Multiplicative Complexity and Nonlinearity
When Trees Grow Low: Shrubs and Fast MSO1
A Type Discipline for Solving Year 2000 Problems in COBOL Programs
Recent Advances in Population Protocols
Lower Bounds for On-Line Single-Machine Scheduling
How to Sort a Train
Two-Planar Graphs Are Quasiplanar
Partial Higher-Order Specifications
A Topological View of Some Problems in Complexity Theory
Approximating Prize-Collecting Variants of TSP
Formal Series over Algebras
The Limit of Split_n-Bisimulations for CCS Agents
Computing Average Value in Ad Hoc Networks
On the Computational Power of Extended Petri Nets
On Some Models of Computability of Boolean Functions
A Numbers-on-Foreheads Game
Balanced k -Colorings
On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems
Probabilistic Model Checking for Strategic Equilibria-Based Decision Making: Advances and Challenges (Invited Talk)
A New Approach to Defining the Complexity for VLSI
Checking Amalgamability Conditions for C ASL Architectural Specifications
On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams
Right-Linear Lattices: An Algebraic Theory of ω-Regular Languages, with Fixed Points
The Giant Component Threshold for Random Regular Graphs with Edge Faults
Concrete Multiplicative Complexity of Symmetric Functions
Competitive Search in the Line and the Star with Predictions
A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem
Lempel-Ziv Dimension for Lempel-Ziv Compression
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
On the Complexity of Reconfiguration in Systems with Legacy Components
Model-Theoretic Forcing in Transition Algebra
Ergodic Theorems and Converses for PSPACE Functions
µ-Calculus Synthesis
Colouring Random Empire Trees
The Theory of the Modified Post Algebras and Multidimensional Automata Structures
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
Proof of a Concurrent Program Finding Euler Paths
On-Line Scheduling with Tight Deadlines
Zeta-Dimension
On the Recognition of Four-Directional Orthogonal Ray Graphs
Equational Calculi for Many-Sorted Algebras with Empty Carrier Sets
Concurrent Games with Arbitrarily Many Players (Invited Talk)
Combinatorial Voter Control in Elections
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
Multiplicity Functions on Omega-Automata
Asymptotic Complexity of Game-Searching Procedures
Testing of Join Dependency Preserving by a Modified Chase Method
Packing Directed Cycles Efficiently
On Fairness in Terminating and Reactive Programs
Query Complexity of Search Problems
Defining the Java Virtual Machine as Platform for Provably Correct Java Compilation
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group
Minimal Letter Frequency in n-th Power-Free Binary Words
Systems of Open Paths in Petri Nets
A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time
Computational and Proof Complexity of Partial String Avoidability
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, Prague, Czech Republic, August 24-28, 2020
On Small Hard Leaf Languages
On Large Zeros of Linear Recurrence Sequences
Universality and Forall-Exactness of Cost Register Automata with Few Registers
The Isomorphism Problem for k-Trees Is Complete for Logspace
An Algebraic Extension of the Chomsky-Hierarchy
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results
Efficient Strongly Universal and Optimally Universal Hashing
The Price of Defense
Nilpotency and Limit Sets of Cellular Automata
Not All Strangers Are the Same: The Impact of Tolerance in Schelling Games
Does Looking Inside a Circuit Help?
On the Descriptive Complexity of Vertex Deletion Problems
Supplementarity is Necessary for Quantum Diagram Reasoning
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
Generation Problems
Higher-Order Constrained Dependency Pairs for (Universal) Computability
Regular Sets of Higher-Order Pushdown Stacks
Fixed-Parameter Algorithms for Fair Hitting Set Problems
Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Kraków, Poland, August 22-26, 2016
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
Simplifying Flow Networks
Piecewise Testable Languages and Nondeterministic Automata
Parallel Recognition and Ranking of Context-Free Languages
On W[1]-Hardness as Evidence for Intractability
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete
The Complexity of Homomorphism Indistinguishability
Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures
Induced Embeddings into Hamming Graphs
The Expressive Power of Two-Variable Least Fixed-Point Logics
Synchronized Petri Nets: A Model for the Description of Non-Autonomous Systems
Concurrency of Manipulations in Multidimensional Information Structures
Pointer Quantum PCPs and Multi-Prover Games
On the Autoreducibility of Random Sequences
Sets of Linear Forms Which Are Hard to Compute
From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions
Equation Satisfiability and Program Satisfiability for Finite Monoids
Mathematical Foundations of Computer Science, 3rd Symposium at Jadwisin near Warsaw, Poland, June 17-22, 1974, Proceedings
A Comparison of Finite and Cellular Automata
Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup
Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices
Structural Analysis of Gapped Motifs of a String
Second Order Logic and the Weak Exponential Hierarchies
Distance Automata Having Large Finite Distance or Finite Ambiguity
Crossing Number Is Hard for Cubic Graphs
Parameterized Complexity of Conflict-Free Matchings and Paths
Color Refinement for Relational Structures
k -Sets of Convex Inclusion Chains of Planar Point Sets
Some Properties of Zerotesting Bounded One-Way Multicounter Machines
On Degeneration of Tensors and Algebras
On the Communication Complexity of Co-linearity Problems
Quantum Multiple-Valued Decision Diagrams in Graphical Calculi
Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth
Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents
A Universally Defined Undecidable Unimodal Logic
Constructing Iterative Version of a System of Recursive Procedures
Planarizing Gadgets for Perfect Matching Do Not Exist
Hardness and Approximation of High-Dimensional Search Problems (Invited Talk)
New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space
Querying and Embedding Compressed Texts
Automata and Categories - Input Processes
On the Periodic Sum and Extensions of Finite Automata
Kolmogorov Complexity: Recent Research in Moscow
Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions
Random Permutations in Computational Complexity
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
Locality Theorems in Semiring Semantics
Accepting Zeno Words Without Making Time Stand Still
Vector Reachability Problem in SL(2, Z)
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees
Typed Horn Logic
Observing Distribution in Processes
Structured Programmability of Iterative Algorithms
Deadlocks and Livelocks in Transition Systems
Repetitiveness of D0L-Languages Is Decidable in Polynomial Time
Pebble Games and Algebraic Proof Systems
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, UK, August 27-31, 2018
A Framework for Producing Deterministic Canonical Bottom-up Parsers
Structural Invariants for Some Classes of Structured Programs
Solving the Sabotage Game Is PSPACE-Hard
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT
Splitsort - An Adaptive Sorting Algorithm
Synthesis for Structure Rewriting Systems
Finite Domain Constraint Satisfaction Using Quantum Computation
One-Way Functions in Complexity Theory
Computational Complexity of Approximation Algorithms for Combinatorial Problems
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
On Synchronous and Asynchronous Interaction in Distributed Systems
Programs, Computations and Temporal Features
Relaxed Core Stability for Hedonic Games with Size-Dependent Utilities
What Do We Learn from Experimental Algorithmics?
New Algorithms for Detecting Morphic Images of a Word
An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
On the Complexity of Genuinely Polynomial Computation
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines
A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic
The Multiparty Communication Complexity of Exact- T : Improved Bounds and New Problems
Optimal RAS Programs for Arbitrarily Complex 0-1 Valued Functions
Quasi-Isometric Reductions Between Infinite Strings
From TCS to Learning Theory (Invited Paper)
On Changes of Input/Output Coding
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
Information Complexity of Online Problems
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches
Mind the Gap! Abstract Versus Concrete Models of Specifications
Solving Irreducible Stochastic Mean-Payoff Games and Entropy Games by Relative Krasnoselskii-Mann Iteration
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
One-Sided Error Communication Complexity of Gap Hamming Distance
The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses
Automata and Categories: Finiteness Contra Minimality
On the Identity Problem for Unitriangular Matrices of Dimension Four
Shortest Unique Substring Queries on Run-Length Encoded Strings
Clustering with Partial Information
Synthesis of Communicating Behaviour
What Are Iteration Theories?
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models
Sliding Windows over Context-Free Languages
Exact Matching in Graphs of Bounded Independence Number
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata
Frequency Algorithms and Computations
Ride Sharing with a Vehicle of Unlimited Capacity
Acceptance Ambiguity for Quantum Automata
Unambiguous Automata on Bi-infinite Words
Finite Satisfiability of Unary Negation Fragment with Transitivity
A Two-Sided Error Distributed Property Tester For Conductance
Stores as Homomorphisms and their Transformations
About Three Equations Classes of Languages Built Up By Shuffle Operations
Mathematical Foundation of Information Retrieval
Fast Balanced Partitioning Is Hard Even on Grids and Trees
The Complexity of Computing Optimum Labelings for Temporal Connectivity
The Hedge: An Efficient Storage Device for Turing Machines with One Head (Extended Abstract)
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Stochastic Timed Games Revisited
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk)
On the Problem of Scheduling Flows on Distributed Networks
Theory of Computation over Stream Algebras, and its Applications
Shortest Path Problems with Time Constraints
On the Complexity of Depth-2 Circuits with Threshold Gates
Series-Parallel Languages on Scattered and Countable Posets
Determinisation of Finitely-Ambiguous Copyless Cost Register Automata
Sparse Oracles, Lowness, and Highness
On Algorithms Based on Finitely Many Homomorphism Counts
The Complexity of Tree Multicolorings
Meta-kernelization with Structural Parameters
Distributed Quantum Computing
On the Branching Structure of Languages
Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
Efficient Matching of Some Fundamental Regular Expressions with Backreferences
Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard
When Can You Play Positionally?
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems
Completeness in Classical Logic of Complex Algorithms
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
The Monadic Theory of Morphic Infinite Words and Generalizations
On the Complexity of Some Ordering Problems
Probabilistic Length-Reducing Automata
The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract)
Attribute Grammars and Two-Level Grammars: A Unifying Approach
On the Power of Algebraic Specifications
The Semi-Full Closure of Pure Type Systems
Polynomial Space Randomness in Analysis
Finding a Maximum Flow in /S, T/-Planar Network in Linear Expected Time
Maximum Flow in Planar Networks
Tally NP Sets and Easy Census Functions
Tranformations to Produce Certain Covering Grammars
Monotone Bounded-Depth Complexity of Homomorphism Polynomials
On the Complexity of Some Problems in Interval Arithmetic
Results on the Dimension Spectra of Planar Lines
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?
Unit Testing for CASL Architectural Specifications
A Resource Applocation Problem
Iterated Regret Minimization in Game Graphs
Classification of Programs of a SPC
Descriptive Complexity for Distributed Computing with Circuits
Deterministic Constrained Multilinear Detection
Lower Bounds for Splittings by Linear Combinations
Balanced Connected Partitioning of Unweighted Grid Graphs
Entropic Risk for Turn-Based Stochastic Games
Complexity Results in Graph Reconstruction
Mutual Dimension and Random Sequences
A Turing Machine Oracle Hierarchy
Real-Time Language Recognition by One-Way and Two-Way Cellular Automata
Emptiness Problems for Integer Circuits
Thue Systems and the Church-Rosser Property
Dimension Characterizations of Complexity Classes
On Some Problems Concerning Pawlak's Machines
On a Subclass of Pseudopolynomial Problems
Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version)
On the Sensitivity Conjecture for Read-k Formulas
The Monoid of Queue Actions
Synchronization of Regular Automata
Future-Looking Logics on Data Words and Trees
Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis
Preserving Total Order in Constant Expected Time
Abstract Implementation of Abstract Data Types
Satisfiability - Algorithms and Logic
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture
Linearly Bounded Infinite Graphs
Fooling Rebound Automata
From Specifications to Programs: A Fork-Algebraic Approach to Bridge the Gap
Semi-linear Parikh Images of Regular Expressions via Reduction
Machines with Input and Output
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth
The Semantics of Semantic Equations
Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components
An Algebraic Approach to Data Types, Program Verification, and Program Synthesis
Reversal Hierarchies for Small 2DFAs
Parallelism of Manipulations in Multidimensional Information Structures
A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs
Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings
A Hierarchy of Irreducible Sofic Shifts
Another Characterization of the Higher K-Trivials
A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation
Time and Tape Bounded Auxiliary Pushdown Automata
Strong Completeness for Markovian Logics
Descriptional Complexity of Concurrent Processes (preliminary version)
One-Rule Trace-Rewriting Systems and Confluence
The Approximate Well-Founded Semantics for Logic Programs with Uncertainty
Decidable Extensions of MSO
A Top-Down No Backtrack Parsing of General Context-Free Languages
An Abduction-Based Method for Index Relaxation in Taxonomy-Based Sources
On Information Storage and Retrieval Systems: An Algebraic Approach, Part I
A Unified Construction of the Glushkov, Follow, and Antimirov Automata
On Checking Versus Evaluation of Multiple Queries
Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings
Multiple Product Modulo Arbitrary Numbers
CNF Encodings of Parity
An Unusual Temporal Logic
On Some Topological Properties of Linear Cellular Automata
Generalizing Roberts' Characterization of Unit Interval Graphs
Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)
Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
Towards a Cardinality Theorem for Finite Automata
The Complexity of Solitaire
Communication Complexity Theory: Thirty-Five Years of Set Disjointness
On Infinite Words Determined by Indexed Languages
Optimally Resilient Strategies in Pushdown Safety Games
Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract)
Ershov's Hierarchy of Real Numbers
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications
On the Complexity of Wavelength Converters
Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, Strbské Pleso, High Tatras, Czechoslovakia, September 3-8, 1973
Revisiting Space in Proof Complexity: Treewidth and Pathwidth
A Periodicity Theorem on Words and Applications
On a Hierarchy of File Types and a Tower of Their Theories
On Multidimensional and Monotone k-SUM
Stochastic Process Creation
Computational Complexity of Covering Three-Vertex Multigraphs
A Subquadratic Algorithm for 3XOR
Learning to Perform Knowledge-Intensive Inferences
Near-Optimal Asymmetric Binary Matrix Partitions
Hypercube LSH for Approximate near Neighbors
On Representations of Dynamic Algebras with Reversion
Counting of Teams in First-Order Team Logics
A Comparison of Two Lower Bound Methods for Communication Complexity
The Expressive Power of Binary Submodular Functions
Packing Edges in Random Regular Graphs
On the Complexity of Noncommutative Polynomial Factorization
Tight Bounds for Complementing Parity Automata
Computing Reciprocals of Bivariate Power Series
The Complexity of Finding Reset Words in Finite Automata
On the Equivalence Problem for E-Pattern Languages
Communication Complexity and Lower Bounds on Multilective Computations
Hierarchical Unambiguity
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines
Differential Bisimulation for a Markovian Process Algebra
Model and Complexity of Termination for Distributed Computations
On Low Complexity Colorings of Grids (Invited Talk)
Speeding-Up Nondeterministic Single-Tape Off-Line Computations by One Alternation
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
Facial Circuits of Planar Graphs and Context-Free Languages
Limiting Negations in Bounded Treewidth and Upward Planar Circuits
Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines
Embedding Fibonacci Cubes into Hypercubes with Omega (2 cn ) Faulty Nodes
An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints
Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable
On the Tree Inclusion Problem
Complexity Bounds for Regular Games
L-Fuzzy Functorial Automata
Substitution Systems - A Family of System Models Based on Concurrency
Event Structures for the Collective Tokens Philosophy of Inhibitor Nets
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions
On Problem Kernels for Possible Winner Determination under the k -Approval Protocol
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials
Concurrent Nondeterministic Processes: Adequacy of Structure and Behaviour
The Arithmetical Hierarchy of Real Numbers
Span Programs and Quantum Time Complexity
Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity
Space-Bounded Unitary Quantum Computation with Postselection
Theory and Practice of Action Semantics