1202 search results - page 79 / 241 » Sortings for Reactive Systems |
128
click to vote
RTA
1995
Springer
15 years 7 months ago
1995
Springer
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable...
118
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refuta...
122
click to vote
APAL
1999
15 years 3 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
135
click to vote
DATESO
2004
15 years 5 months ago
2004
Approach based on clustering will be described in our paper. Basic version of our system was given in [5] allows us to expand query through special index. Hierarchical agglomerativ...
ACL
1998
15 years 5 months ago
1998
: The goal of this paper is to provide computable account for some definite descriptions. To this end, we define in terms of inclusion the notion of distinguishing description and ...