Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
24
click to vote
IGPL
2000
favorite
Email
discuss
report
68
views
more
IGPL 2000
»
Reachability Logic: An Efficient Fragment of Transitive Closure Logic
13 years 8 months ago
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...
more »
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)
Researcher Info
IGPL 1998 Study Group
Computer Vision