934 search results - page 125 / 187 » Elementary Sets of Logic Programs |
POPL
2010
ACM
15 years 7 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
AOSD
2007
ACM
15 years 1 months ago
2007
ACM
Design rules express constraints on the behavior and structure of a program. These rules can help ensure that a program follows a set of established practices, and avoids certain ...
CCE
2004
14 years 9 months ago
2004
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
SIGSOFT
2005
ACM
15 years 10 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
106
click to vote
LPKR
1997
Springer
15 years 2 months ago
1997
Springer
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a do...