Sciweavers

479 search results - page 74 / 96
» The theory and calculus of aliasing
Sort
View
FP
1995
110views Formal Methods» more  FP 1995»
13 years 11 months ago
Using Types to Parse Natural Language
We describe a natural language parser that uses type information to determine the grammatical structure of simple sentences and phrases. This stands in contrast to studies of type...
Mark P. Jones, Paul Hudak, Sebastian Shaumyan
ACL
1989
13 years 9 months ago
A Three-Valued Interpretation of Negation in Feature Structure Descriptions
Feature structures are informational elements that have been used in several linguistic theories and in computational systems for natural-language processing. A logicaJ calculus h...
Anuj Dawar, K. Vijay-Shanker
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 7 months ago
Graph Algorithms for Improving Type-Logical Proof Search
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
Richard Moot
ENTCS
2007
116views more  ENTCS 2007»
13 years 7 months ago
A Logical Characterisation of Static Equivalence
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
Hans Hüttel, Michael D. Pedersen
AI
2004
Springer
13 years 7 months ago
An attempt to formalise a non-trivial benchmark problem in common sense reasoning
Most logic-based AI research works at a meta-theoretical level, producing new logics and studying their properties. Little effort is made to show how these logics can be used to f...
Murray Shanahan