Volume 26,
Number 1-4,
1999
Artificial Intelligence and Mathematics IX
- Joseph Y. Halpern:
Set-theoretic completeness for epistemic and conditional logic.
1-27
- Alexander Brodsky, Yehoshua Sagiv:
Inference of monotonicity constraints in Datalog programs.
29-57
- Fumiaki Okushi:
Parallel cooperative propositional theorem proving.
59-85
- Allen Van Gelder, Fumiaki Okushi:
A propositional theorem prover to solve planning and other problems.
87-112
- Allen Van Gelder, Fumiaki Okushi:
Lemma and cut strategies for propositional model elimination.
113-132
- Peter Jonsson:
Strong bounds on the approximability of two Pspace-hard problems in propositional planning.
133-147
- Daniel Frost, Rina Dechter:
Maintenance scheduling problems as benchmarks for constraint algorithms.
149-170
- Endre Boros, Tonguç Ünlüyurt:
Diagnosing double regular systems.
171-191
- Xiaodong Li, Martin K. Purvis:
Pattern recognition by an optical thin-film multilayer model.
193-213
- Zippora Arzi-Gonczarowski:
Perceive this as that - Analogies, artificial perception, and category theory.
215-252
- Joseph Y. Halpern:
Errata: "The relationship between knowledge, belief, and certainty".
253-256
Last update Fri May 25 08:53:07 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
