Sciweavers

1781 search results - page 102 / 357
» Functional Answer Set Programming
Sort
View
ASP
2003
Springer
15 years 4 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...
PASTE
2010
ACM
15 years 4 months ago
Extracting compiler provenance from program binaries
We present a novel technique that identifies the source compiler of program binaries, an important element of program provenance. Program provenance answers fundamental questions...
Nathan E. Rosenblum, Barton P. Miller, Xiaojin Zhu
ICS
1997
Tsinghua U.
15 years 3 months ago
Iteration Space Slicing and Its Application to Communication Optimization
Program slicing is an analysis that answers questions such as \Which statements might a ect the computation of variable v at statement s?" or \Which statements depend on the ...
William Pugh, Evan Rosser
ESWS
2009
Springer
15 years 5 months ago
Hybrid Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
Cristina Feier, Stijn Heymans
DMSN
2004
ACM
15 years 4 months ago
Region streams: functional macroprogramming for sensor networks
Sensor networks present a number of novel programming challenges for application developers. Their inherent limitations of computational power, communication bandwidth, and energy...
Ryan Newton, Matt Welsh