4036 search results - page 458 / 808 » Formal Methods |
175
click to vote
AIPS
2006
15 years 8 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
208
click to vote
AVI
1996
15 years 8 months ago
1996
Visual interfaces to computer systems are interactive. The cycle of visual interaction involves both visual perception and action. This paper examines formal models of interactive...
179
click to vote
COLING
1992
15 years 8 months ago
1992
The normal method for representing anaphoric dependencies in Unification Based grammar tbrmalisms is that of re-entrance. In this paper, we address the problems that this represen...
168
click to vote
ENTCS
2007
15 years 6 months ago
2007
Refactorings are changes made to programs, models or specifications with the intention of improving their structure and thus making them clearer, more readable and re-usable. Ref...
146
click to vote
IPL
2007
15 years 6 months ago
2007
We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non-LR(k) grammars, for any k, are handled determinist...