Sciweavers

3653 search results - page 217 / 731
» On Recognizable Timed Languages
Sort
View
ICALP
2010
Springer
15 years 7 months ago
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable
Abstract. The HalpernShoham logic is a modal logic of time intervals. Some eort has been put in last ten years to classify fragments of this beautiful logic with respect to decid...
Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kie...
COLING
2000
15 years 6 months ago
Comparing two trainable grammatical relations finders
Grammatical relationships (Glls) form an important level of natural language processing, but different sets of ORs are useflfl for different purposes. Theretbre, one may often onl...
Alexander S. Yeh
ACL
1990
15 years 6 months ago
Free Indexation: Combinatorial Analysis and a Compositional Algorithm
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters langua...
Sandiway Fong
ENTCS
2006
148views more  ENTCS 2006»
15 years 5 months ago
Towards the Semantics and Verification of BPEL4WS
Abstract. In this paper, we discuss the semantics of BPEL4WS language which is a de facto standard for specifying and execution workflow specification for web service composition a...
Geguang Pu, Xiangpeng Zhao, Shuling Wang, Zongyan ...
ICALP
1994
Springer
15 years 9 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias