Sciweavers

209 search results - page 25 / 42
» Logic and refinement for charts
Sort
View
COLING
1996
14 years 11 months ago
Reversible delayed lexical choice in a bidirectional framework
We describe a bidirectional framework for natural language parsing and generation, using a typedfeatureformalismand an HPSG-based grammar with a parser and generator derived from ...
Graham Wilcock, Yuji Matsumoto
FORTE
1994
14 years 11 months ago
Four issues concerning the semantics of Message Flow Graphs
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
Peter B. Ladkin, Stefan Leue
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
15 years 1 months ago
Human competitive security protocols synthesis
This poster paper outlines a method for a search based approach to the development of provably correct protocols. Categories and Subject Descriptors C.2.2 [Computer Communication ...
Hao Chen, John A. Clark, Jeremy Jacob
DEXA
2010
Springer
157views Database» more  DEXA 2010»
14 years 9 months ago
Containment of Conjunctive Queries with Negation: Algorithms and Experiments
We consider the containment problem for conjunctive queries with atomic negation. Firstly, we refine an existing algorithm based on homomorphism checks, which itself improves other...
Khalil Ben Mohamed, Michel Leclère, Marie-L...
ENTCS
2000
120views more  ENTCS 2000»
14 years 9 months ago
Efficient Substitution in Hoare Logic Expressions
Substitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important...
Roberto Virga