76 search results - page 16 / 16 » A Tabulation Proof Procedure for Residuated Logic Programmin... |
CORR
2004
Springer
13 years 5 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 ...