Sciweavers

8512 search results - page 23 / 1703
» Computing Theory With Relevance
Sort
View
POPL
2008
ACM
14 years 8 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
LPAR
2000
Springer
13 years 11 months ago
On the Complexity of Theory Curbing
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
Thomas Eiter, Georg Gottlob
ITICSE
2004
ACM
14 years 1 months ago
What do we mean by theoretically sound research in computer science education?
With our interest to improve our education in computer science, an understanding of how students learn about CS concepts, how different concepts are understood, as well as the con...
Mordechai Ben-Ari, Anders Berglund, Shirley Booth,...
COGSCI
2008
139views more  COGSCI 2008»
13 years 8 months ago
A Computational Model of Early Argument Structure Acquisition
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...
Afra Alishahi, Suzanne Stevenson
AGI
2008
13 years 9 months ago
Adversarial Sequence Prediction
Sequence prediction is a key component of intelligence. This can be extended to define a game between intelligent agents. An analog of a result of Legg shows that this game is a co...
Bill Hibbard