9626 search results - page 185 / 1926 » Invariant Based Programming |
175
click to vote
AMAI
2008
Springer
15 years 6 months ago
2008
Springer
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
147
click to vote
IJCAI
1993
15 years 7 months ago
1993
The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...
163
click to vote
LPNMR
2004
Springer
15 years 11 months ago
2004
Springer
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the que...
177
click to vote
PUC
1998
15 years 6 months ago
1998
In this paper we describe a way to save and restore the state of a running Java program. We achieve this on the language level, without modifying the Java virtual machine, by instr...
169
click to vote
LOPSTR
2007
Springer
16 years 15 days ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...