52 search results - page 4 / 11 » Reexecution-Based Analysis of Logic Programs with Delay Decl... |
AAAI
2006
13 years 8 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
ENTCS
2007
13 years 7 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
FMOODS
2008
13 years 8 months ago
2008
Abstract. Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
We are witnessing an exciting revival of interest in recursive Datalog queries in a variety of emerging application domains such as data integration, information extraction, netwo...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...