50 search results - page 9 / 10 » Strictly Level-Decreasing Logic Programs |
IFIP
2009
Springer
13 years 2 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
DLOG
2008
13 years 7 months ago
2008
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
POPL
2006
ACM
14 years 5 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
VEE
2010
ACM
14 years 5 days ago
2010
ACM
Intense research on virtual machines has highlighted the need for flexible software architectures that allow quick evaluation of new design and implementation techniques. The inte...
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 ...