387 search results - page 20 / 78 » Hyperequivalence of Logic Programs with Respect to Supported... |
AMAI
2008
Springer
13 years 7 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...
AAAI
2004
13 years 9 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
PADL
2001
Springer
14 years 3 days ago
2001
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...