Annals of Mathematics and Artificial Intelligence, Volume 44

Volume 44, Number 1-2, May 2005

• Robert Saxon Milnikel:
  Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics. 1-34
  Electronic Edition (link) BibTeX
• Jinchang Wang:
  A cost-reducing question-selection algorithm for propositional knowledge-based systems. 35-60
  Electronic Edition (link) BibTeX
• Víctor Dalmau:
  A new tractable class of constraint satisfaction problems. 61-85
  Electronic Edition (link) BibTeX
• Quoc Bao Vo, Norman Y. Foo, Joe Thurbon:
  Semantics for a theory of defeasible reasoning. 87-119
  Electronic Edition (link) BibTeX
• DoRon B. Motter, Jarrod A. Roy, Igor L. Markov:
  Resolution cannot polynomially simulate compressed-BFS. 121-156
  Electronic Edition (link) BibTeX
• Hans van Maaren, Linda van Norden:
  Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances. 157-177
  Electronic Edition (link) BibTeX

Volume 44, Number 3, July 2005

• Shantanu Biswas, Y. Narahari:
  Iterative Dutch combinatorial auctions. 185-205
  Electronic Edition (link) BibTeX
• S. Shaheen Fatima, Michael Wooldridge, Nicholas R. Jennings:
  Bargaining with incomplete information. 207-232
  Electronic Edition (link) BibTeX
• Alan J. King, Olga Streltchenko, Yelena Yesha:
  Using multi-agent simulation to understand trading dynamics of a derivatives market. 233-253
  Electronic Edition (link) BibTeX
• Can C. Özturan:
  Used car salesman problem: A differential auction-barter market. 255-267
  Electronic Edition (link) BibTeX
• David C. Parkes:
  Auction design with costly preference elicitation. 269-302
  Electronic Edition (link) BibTeX

Volume 44, Number 4, August 2005

• Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek:
  Logic programming with infinite sets. 309-339
  Electronic Edition (link) BibTeX
• Hubie Chen:
  The expressive rate of constraints. 341-352
  Electronic Edition (link) BibTeX
• Gabriel Istrate, Stefan Boettcher, Allon G. Percus:
  Spines of random constraint satisfaction problems: definition and connection with computational complexity. 353-372
  Electronic Edition (link) BibTeX
• Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä:
  Unrestricted vs restricted cut in a tableau method for Boolean circuits. 373-399
  Electronic Edition (link) BibTeX
• Andrew Lee:
  Learning via finitely many queries. 401-418
  Electronic Edition (link) BibTeX
• Haiou Shen, Hantao Zhang:
  Improving exact algorithms for MAX-2-SAT. 419-436
  Electronic Edition (link) BibTeX