In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol (1994) and Blackburn and Meyer-Viol (1994). We conclude with a proof of the EXPTIMEcompleteness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving.
|Konference||9th International Workshop on Computer Science Logic, CSL 1995 held as Annual Conference of the European Association for Computer Science, EACSL 1995|
|Periode||22/09/1995 → 29/09/1995|
|Sponsor||European Union, HCM Euroconference Program, University of Paderborn, Universitätsgesellschaft Paderborn|
|Navn||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|