Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

94

Voted

IGPL
2000

68views more IGPL 2000»

Reachability Logic: An Efficient Fragment of Transitive Closure Logic

15 years 2 months ago

Reachability Logic: An Efficient Fragment of Transitive Closure Logic

Download www.cs.nott.ac.uk

Natasha Alechina, Neil Immerman

Real-time Traffic

IGPL 2000 |

claim paper

Related Content

» A Decidable Fragment of Separation Logic

» Decidability of the Guarded Fragment with the Transitive Closure

» Deciding Termination of Query Evaluation in TransitiveClosure Logics for Constraint Databa...

» The Boundary Between Decidability and Undecidability for TransitiveClosure Logics

» Reachability Problems on Regular Ground Tree Rewriting Graphs

» Model Checking Synchronized Products of Infinite Transition Systems

» On Role Logic

» Reachability and the Power of Local Ordering

» Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SA...

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	IGPL
Authors	Natasha Alechina, Neil Immerman

Comments (0)