22 search results - page 5 / 5 » The CIFF Proof Procedure for Abductive Logic Programming wit... |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
CAV
2008
Springer
13 years 6 months ago
2008
Springer
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...