Sciweavers

5 search results - page 1 / 1
» Form-giving: expressing the nonobvious
Sort
View
CHI
1994
ACM
13 years 9 months ago
Form-giving: expressing the nonobvious
The design of richly informative interfaces would benefit from an account of how visual forms convey information. In this paper we suggest that the study of form-giving in Industr...
Gerda Smets, Kees Overbeeke, William W. Gaver
NAACL
2007
13 years 6 months ago
Extracting Appraisal Expressions
Sentiment analysis seeks to characterize opinionated or evaluative aspects of natural language text. We suggest here that appraisal expression extraction should be viewed as a fun...
Kenneth Bloom, Navendu Garg, Shlomo Argamon
LPNMR
2004
Springer
13 years 10 months ago
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
Thomas Eiter, Axel Polleres
AGP
2003
IEEE
13 years 10 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres
POPL
2008
ACM
14 years 5 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...