Sciweavers

38 search results - page 3 / 8
» Mathematical Foundations of Answer Set Programming
Sort
View
POPL
2004
ACM
15 years 9 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
DBPL
2007
Springer
100views Database» more  DBPL 2007»
15 years 3 months ago
Provenance as Dependency Analysis
Abstract. Provenance is information recording the source, derivation, or history of some information. Provenance tracking has been studied in a variety of settings; however, althou...
James Cheney, Amal Ahmed, Umut A. Acar
78
Voted
COMPGEOM
2003
ACM
15 years 2 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
ASP
2003
Springer
15 years 2 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
73
Voted
ERSHOV
1999
Springer
15 years 1 months ago
The Essence of Program Transformation by Partial Evaluation and Driving
Abstract. An abstract framework is developed to describe program transformation by specializing a given program to a restricted set of inputs. Particular cases include partial eval...
Neil D. Jones