764 search results - page 79 / 153 » On the Expressibility of Stable Logic Programming |
DOCENG
2009
ACM
15 years 6 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
ICLP
1991
Springer
15 years 3 months ago
1991
Springer
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
105
click to vote
PLANX
2007
15 years 1 months ago
2007
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
120
click to vote
PLANX
2007
15 years 1 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
GPCE
2004
Springer
15 years 5 months ago
2004
Springer
This paper describes Splice, a system for writing aspects that perform static program analyses to direct program modifications. The power of an inter-procedural data-flow analys...