140 search results - page 21 / 28 » Stable Models and Non-Determinism in Logic Programs with Neg... |
109
click to vote
SLP
1993
15 years 3 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
243
click to vote
ICLP
2009
Springer
16 years 2 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
CADE
2008
Springer
16 years 2 months ago
2008
Springer
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
122
Voted
IFIP
2009
Springer
14 years 11 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...
117
Voted
AMW
2010
15 years 3 months ago
2010
A Data Warehouse (DW) is a data repository that integrates data from multiple sources and organizes the data according to a set of data structures called dimensions. Each dimension...