1445 search results - page 198 / 289 » Abstract Interpretation of Logic Programs |
112
click to vote
LPNMR
1990
Springer
15 years 7 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
107
click to vote
ESOP
2007
Springer
15 years 9 months ago
2007
Springer
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and t...
144
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
131
click to vote
ESAW
2009
Springer
15 years 9 months ago
2009
Springer
Multi-agent systems are viewed as consisting of individual agents whose behaviors are regulated by organization artifacts. This abstract presents a programming language, which is d...
121
click to vote
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...