Sciweavers

1683 search results - page 203 / 337
» Natural Language Processing (almost) from Scratch
Sort
View
195
Voted
ACL
1990
15 years 5 months ago
Automated Inversion of Logic Grammars for Generation
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
Tomek Strzalkowski, Ping Peng
130
Voted
LADS
2007
Springer
15 years 10 months ago
Goal Selection Strategies for Rational Agents
In agent theory and agent programming, goals constitute the motivational attitude of rational agents and form the key concept in explaining and generating their pro-active behavior...
Nick A. M. Tinnemeier, Mehdi Dastani, John-Jules C...
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 8 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
ECMDAFA
2009
Springer
170views Hardware» more  ECMDAFA 2009»
15 years 10 months ago
A Model Driven Approach to the Analysis of Timeliness Properties
The need for a design language that is rigorous but accessible and intuitive is often at odds with the formal and mathematical nature of languages used for analysis. UML and Petri ...
Mohamed Ariff Ameedeen, Behzad Bordbar, Rachid Ana...
LACL
2005
Springer
15 years 9 months ago
Strict Deterministic Aspects of Minimalist Grammars
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
John T. Hale, Edward P. Stabler