Sciweavers

140 search results - page 21 / 28
» Stable Models and Non-Determinism in Logic Programs with Neg...
Sort
View
90
Voted
SLP
1993
110views more  SLP 1993»
15 years 1 months ago
Logic Program Specialisation With Deletion of Useless Clauses
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. ...
D. Andre de Waal, John P. Gallagher
202
Voted
ICLP
2009
Springer
16 years 9 days ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
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 (...
Miroslaw Truszczynski
CADE
2008
Springer
15 years 12 months ago
Model Checking for Stability Analysis in Rely-Guarantee Proofs
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...
Hasan Amjad, Richard Bornat
99
Voted
IFIP
2009
Springer
14 years 9 months ago
Finite Models in FOL-Based Crypto-Protocol Verification
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
Jan Jürjens, Tjark Weber
AMW
2010
15 years 1 months ago
Logic Programs for Repairing Inconsistent Dimensions in Data Warehouses
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...
Loreto Bravo, Mónica Caniupán Marile...