Search
Selected: All

A Complete and Terminating Execution Model for Constraint Handling Rules

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Complete Characterization of Complete Intersection-Type Theories

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Completeness Theorem for "Total Boolean Functions"

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A computational definition of the notion of vectorial space

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Computer Verified Theory of Compact Sets

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A computer verified, monadic, functional implementation of the integral

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Concrete Final Coalgebra Theorem for ZF Set Theory

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Concrete Representation of Observational Equivalence for PCF

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Concurrent Calculus with Atomic Transactions

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A convenient differential category

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Cook's Tour of the Finitary Non-Well-Founded Sets

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A criterion for separating process calculi

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A CSP Account of Event-B Refinement

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Cut-Free ExpTime Tableau Decision Procedure for the Logic Extending Converse-PDL with Regular Inclusion Axioms

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Cut-free Sequent Calculus for Bi-Intuitionistic Logic: Extended Version

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Decidable Class of Nested Iterated Schemata (extended version)

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Decidable Fragment of Strategy Logic

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A decidable policy language for history-based transaction monitoring

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Decidable Probability Logic for Timed Probabilistic Systems

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Decidable Timeout based Extension of Propositional Linear Temporal Logic

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.