Sciweavers

BIRTHDAY
2006
Springer
13 years 8 months ago
Reductio ad Absurdum: Planning Proofs by Contradiction
Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
Erica Melis, Martin Pollet, Jörg H. Siekmann
EPIA
2005
Springer
13 years 10 months ago
Revised Stable Models - A Semantics for Logic Programs
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
Luís Moniz Pereira, Alexandre Miguel Pinto