Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Logics for Unranked Trees: An Overview

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2006
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030186458054659
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:6713
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2006
publishDateSort 2006
record_format rss_article
spellingShingle Logics for Unranked Trees: An Overview
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Logics for Unranked Trees: An Overview
title_auth Logics for Unranked Trees: An Overview
title_full Logics for Unranked Trees: An Overview
title_fullStr Logics for Unranked Trees: An Overview
title_full_unstemmed Logics for Unranked Trees: An Overview
title_short Logics for Unranked Trees: An Overview
title_sort logics for unranked trees: an overview
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.2168/LMCS-2(3:2)2006