756 search results - page 49 / 152 » Using Logic Programs to Reason about Infinite Sets |
LPNMR
1999
Springer
15 years 2 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
KR
1998
Springer
15 years 1 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
FAC
2007
14 years 9 months ago
2007
In object-oriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial p...
FLOPS
2010
Springer
15 years 4 months ago
2010
Springer
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
109
click to vote
SIGSOFT
2006
ACM
15 years 3 months ago
2006
ACM
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...