Sciweavers

5482 search results - page 491 / 1097
» Logic Programming and Databases
Sort
View
POPL
2000
ACM
15 years 11 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
ICLP
1994
Springer
15 years 11 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...
CORR
2008
Springer
94views Education» more  CORR 2008»
15 years 7 months ago
A Toolkit for Scalable Spreadsheet Visualization
This paper presents a toolkit for spreadsheet visualization based on logical areas, semantic classes and data Logical areas, semantic classes and data modules are abstract represe...
Markus Clermont
ENTCS
2002
91views more  ENTCS 2002»
15 years 7 months ago
Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...
Brigitte Pientka
PRDC
2006
IEEE
16 years 1 months ago
Towards Timely ACID Transactions in DBMS
On-time data management is becoming a key difficulty faced by the information infrastructure of most organizations. In fact, database applications for critical areas are increasing...
Marco Vieira, António Casimiro Costa, Henri...