46 search results - page 2 / 10 » A Monotonicity Theorem for Extended Logic Programs |
NMR
2004
Springer
13 years 11 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
TABLEAUX
1997
Springer
13 years 10 months ago
1997
Springer
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an...
ICLP
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
CSL
2004
Springer
13 years 9 months ago
2004
Springer
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
ECSQARU
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...