Sciweavers

7167 search results - page 1250 / 1434
» Answer Set Programming
Sort
View
ECCC
2010
89views more  ECCC 2010»
13 years 9 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
ENGL
2008
100views more  ENGL 2008»
13 years 9 months ago
HIDE+: A Logic Based Hardware Development Environment
With the advent of System-On-Chip (SOC) technology, there is a pressing need to enhance the quality of ools available and increase the level of abstraction at which hardware is des...
Abdsamad Benkrid, Khaled Benkrid
ENTCS
2008
78views more  ENTCS 2008»
13 years 9 months ago
Silver: an Extensible Attribute Grammar System
Attribute grammar specification languages, like many domain specific languages, offer significant advantages to their users, such as high-level declarative constructs and domain-s...
Eric Van Wyk, Derek Bodin, Jimin Gao, Lijesh Krish...
ENTCS
2008
102views more  ENTCS 2008»
13 years 9 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ENTCS
2008
120views more  ENTCS 2008»
13 years 9 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
« Prev « First page 1250 / 1434 Last » Next »