Sciweavers

2911 search results - page 419 / 583
» A Logic of Graph Constraints
Sort
View
AAAI
1990
15 years 2 months ago
Exploiting Locality in a TMS
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...
Johan de Kleer
104
Voted
DIAGRAMS
2010
Springer
15 years 1 months ago
An Attention Based Theory to Explore Affordances of Textual and Diagrammatic Proofs
Shimojima and Katagiri have demonstrated that diagrams reduce "inferential load" during reasoning by scaffolding visual-spatial aspects of memory. In response, we wondere...
Peter Coppin, Jim Burton, Stephen Hockema
110
Voted
ICFP
2010
ACM
15 years 1 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
99
Voted
ISLPED
2010
ACM
206views Hardware» more  ISLPED 2010»
15 years 1 months ago
Energy efficient implementation of parallel CMOS multipliers with improved compressors
Booth encoding is believed to yield faster multiplier designs with higher energy consumption. 16x16-bit Booth and NonBooth multipliers are analyzed in energy and delay space under...
Dursun Baran, Mustafa Aktan, Vojin G. Oklobdzija
123
Voted
JFP
2008
125views more  JFP 2008»
15 years 23 days ago
Types and trace effects of higher order programs
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
Christian Skalka, Scott F. Smith, David Van Horn