Sciweavers

750 search results - page 68 / 150
» Declarative event-oriented programming
Sort
View
LOPSTR
1994
Springer
14 years 2 months ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
AUSAI
2006
Springer
14 years 1 months ago
LPForget: A System of Forgetting in Answer Set Programming
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
Fu-Leung Cheng, Thomas Eiter, Nathan Robinson, Abd...
ENTCS
2008
102views more  ENTCS 2008»
13 years 10 months ago
Programming Languages For Interactive Computing
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
Roly Perera
XIMEP
2006
ACM
161views Database» more  XIMEP 2006»
14 years 4 months ago
Programming with XQuery
XQuery is a declarative language for querying and updating XML data sources. Interfacing XQuery to a host programming language is difficult because of the type system mismatch, an...
Donald D. Chamberlin, Michael J. Carey, Daniela Fl...
ENC
2005
IEEE
14 years 3 months ago
Inferring acceptable arguments with Answer Set Programming
Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in...
Mauricio Osorio, Claudia Zepeda, Juan Carlos Nieve...