Sciweavers

1076 search results - page 93 / 216
» Operations on proofs and labels
Sort
View
TACAS
1997
Springer
146views Algorithms» more  TACAS 1997»
14 years 2 months ago
Compositional State Space Generation from Lotos Programs
This paper describes a compositional approach to generate the labeled transition system representing the behavior of a Lotos program by repeatedly alternating composition and reduc...
Jean-Pierre Krimm, Laurent Mounier
COLING
2008
13 years 11 months ago
Stopping Criteria for Active Learning of Named Entity Recognition
Active learning is a proven method for reducing the cost of creating the training sets that are necessary for statistical NLP. However, there has been little work on stopping crit...
Florian Laws, Hinrich Schütze
ACL
1993
13 years 11 months ago
A Unification-Based Parser for Relational Grammar
We present an implemented unification-based parser for relational grammars developed within the stratified feature grammar (SFG) framework, which generalizes Kasper-Rounds logic t...
David E. Johnson, Adam Meyers, Lawrence S. Moss
ENTCS
2008
105views more  ENTCS 2008»
13 years 10 months ago
Checking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Tobias Blechmann, Christel Baier
ENTCS
2006
124views more  ENTCS 2006»
13 years 10 months ago
Formal Conformance Testing of Systems with Refused Inputs and Forbidden Actions
The article introduces an extension of the well-known conformance relation ioco on labeled transition systems (LTS) with refused inputs and forbidden actions. This extension helps...
Igor B. Bourdonov, Alexander Kossatchev, Victor V....