Sciweavers

844 search results - page 111 / 169
» Safraless Decision Procedures
Sort
View
EACL
1993
ACL Anthology
13 years 10 months ago
Disjunctions and Inheritance in the Context Feature Structure System
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
Martin Böttcher
EACL
1989
ACL Anthology
13 years 10 months ago
Computational Semantics Of Mass Terms
Although the formalisms normally used for describing the semantics of natural languages are far from computationally tractable, it is possible to isolate particular semantic pheno...
Jan Tore Lønning
FORTE
1990
13 years 10 months ago
Verifying Bisimulations "On the Fly"
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisim...
Jean-Claude Fernandez, Laurent Mounier
ASIAN
2009
Springer
334views Algorithms» more  ASIAN 2009»
13 years 10 months ago
A Dolev-Yao Model for Zero Knowledge
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh
ICASSP
2010
IEEE
13 years 9 months ago
Stochastic pronunciation modelling and soft match for out-of-vocabulary spoken term detection
A major challenge faced by a spoken term detection (STD) system is the detection of out-of-vocabulary (OOV) terms. Although a subword-based STD system is able to detect OOV terms,...
Dong Wang, Simon King, Joe Frankel, Peter Bell