Annals of Mathematics and Artificial Intelligence, Volume 18

Volume 18, Number 1, 1996

• Rachel Ben-Eliyahu, Rina Dechter: On Computing Minimal Models. 3-27
• Marco Cadoli, Marco Schaerf: On the complexity of Entailment in Propositional Multivalued Logics. 29-50
• James P. Delgrande, Arvind Gupta: The Complexity of Minimum Partial Truth Assignments and Implication in Negation-Free Formulae. 51-67
• Kutluhan Erol, James A. Hendler, Dana S. Nau: Complexity Results for HTN Planning. 69-93

Volume 18, Numbers 2-4, 1996

• Hans-Jürgen Bürckert, Bernhard Hollunder, Armin Laux: On Skolemization in Constrained Logics. 95-131
• Bernhard Hollunder: Consistency Checking Reduced to Satisfiability of Concepts in Terminological Systems. 133-157
• Robert F. Stärk: Multi-Valued Autoepistemic Logic. 159-174
• Franz Baader: Using Automata Theory for Characterizing the Semantics of Terminological Cycles. 175-219
• Manfred Kerber, Axel Präcklein: Using Tactics to Reformulate Formulae for Resolution Theorem Proving. 221-241
• Michael Buro, Hans Kleine Büning: On Resolution with Short Clauses. 243-260
• Christoph Weidenbach: Unification in Sort Theories and Its Applications. 261-293