Set-theoretic completeness for epistemic and conditional logic Joseph Y. Halpern OriginalPaper Pages: 1 - 27
Inference of monotonicity constraints in Datalog programs Alexander BrodskyYehoshua Sagiv OriginalPaper Pages: 29 - 57
A propositional theorem prover to solve planning and other problems Allen Van GelderFumiaki Okushi OriginalPaper Pages: 87 - 112
Lemma and cut strategies for propositional model elimination Allen Van GelderFumiaki Okushi OriginalPaper Pages: 113 - 132
Strong bounds on the approximability of two Pspace-hard problems in propositional planning Peter Jonsson OriginalPaper Pages: 133 - 147
Maintenance scheduling problems as benchmarks for constraint algorithms Daniel FrostRina Dechter OriginalPaper Pages: 149 - 170
Pattern recognition by an optical thin-film multilayer model Xiaodong LiMartin Purvis OriginalPaper Pages: 193 - 213
Perceive this as that – Analogies, artificial perception, and category theory Zippora Arzi-Gonczarowski OriginalPaper Pages: 215 - 252
Errata: “The relationship between knowledge, belief, and certainty” Joseph Y. Halpern OriginalPaper Pages: 253 - 256