756 search results - page 15 / 152 » Using Logic Programs to Reason about Infinite Sets |
LFP
1992
13 years 9 months ago
1992
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
ASP
2003
Springer
14 years 1 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
JLP
2007
13 years 8 months ago
2007
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
DALT
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we investigate the multiagent planning problem in the presence of cooperative actions and agents, which have their own goals and are willing to cooperate. To this en...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...