<--- Back to Details
First PageDocument Content
Shudehill Interchange / Transport in Manchester / First Manchester / Blue Bus and Coach Services / Greater Manchester / Geography of England / Wigan
Date: 2010-11-30 12:52:27
Shudehill Interchange
Transport in Manchester
First Manchester
Blue Bus and Coach Services
Greater Manchester
Geography of England
Wigan

Add to Reading List

Source URL: www.firstgroup.com

Download Document from Source Website

File Size: 15,23 KB

Share Document on Facebook

Similar Documents

Formal methods / Theoretical computer science / Complexity classes / Automated theorem proving / Vampire / NP / IP / Mathematics / Constraint programming / Proof compression

Cooperating Proof Attempts Giles Reger, Dmitry Tishkovsky, and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. This paper introduces a pseudo-concurrent architecture for first-order saturation-based

DocID: 1xVvH - View Document

Mathematics / Mathematical logic / Logic / Model theory / Logic in computer science / Semantics / Universal algebra / Boolean satisfiability problem / Interpretation / First-order logic / Resolution / Clause

Finding Finite Models in Multi-Sorted First-Order Logic? Giles Reger1 , Martin Suda1 , and Andrei Voronkov1,2,University of Manchester, Manchester, UK

DocID: 1xUV9 - View Document

Software / Automated theorem proving / Theoretical computer science / Formal methods / TPTP / Proof assistant / Frama-C / Theorem prover / E theorem prover / Theorem / Isabelle

Checkable Proofs for First-Order Theorem Proving Giles Reger1 , Martin Suda2 1 School of Computer Science, University of Manchester, UK 2 TU Wien, Vienna, Austria

DocID: 1xURz - View Document

Temporal logic / Formal languages / Logic / Metalogic / Mathematical logic / Linear temporal logic / Mathematics / Model theory / Symbol / Computation tree logic / Interpretation / Well-formed formula

From First-order Temporal Logic to Parametric Trace Slicing Giles Reger and David Rydeheard University of Manchester, Manchester, UK Abstract. Parametric runtime verification is the process of verifying properties of ex

DocID: 1xULF - View Document

Theoretical computer science / Automated theorem proving / Mathematics / Mathematical logic / Formal methods / Logic in computer science / Resolution / Logic programming / Clause / Vampire / Boolean satisfiability problem / CARINE

Playing with AVATAR Giles Reger, Martin Suda and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. Modern first-order resolution and superposition theorem provers use saturation algorithms to search fo

DocID: 1xTM6 - View Document