default search action
Annals of Mathematics and Artificial Intelligence, Volume 55
Volume 55, Numbers 1-2, February 2009
- Silvio Ranise, Ullrich Hustadt:
Preface. 1-2 - Arnaud Fietzke, Christoph Weidenbach:
Labelled splitting. 3-34 - Peter Höfner, Georg Struth, Geoff Sutcliffe:
Automated verification of refinement laws. 35-62 - Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Roberto Sebastiani:
Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis. 63-99 - Yeting Ge, Clark W. Barrett, Cesare Tinelli:
Solving quantified verification conditions using satisfiability modulo theories. 101-122 - Fabrice Nahon, Claude Kirchner, Hélène Kirchner, Paul Brauner:
Inductive proof search modulo. 123-154 - Renate A. Schmidt:
A new methodology for developing deduction methods. 155-187
Volume 55, Numbers 3-4, April 2009
- Nicola Gatti:
Extending the alternating-offers protocol in the presence of competition: models and theoretical analysis. 189-236 - Timothy C. Havens, James C. Bezdek, James M. Keller, Mihail Popescu, Jacalyn M. Huband:
Is VAT really single linkage in disguise? 237-251 - Iyad Rahwan, Philippe Pasquier, Liz Sonenberg, Frank Dignum:
A formal analysis of interest-based negotiation. 253-276 - Gerasimos G. Rigatos:
Cooperative behavior of nano-robots as an analogous of the quantum harmonic oscillator. 277-294 - Xuan-Ha Vu, Djamila Sam-Haroud, Boi Faltings:
Enhancing numerical constraint propagation using multiple inclusion representations. 295-354 - Alex Dekhtyar, Michael I. Dekhtyar:
The theory of interval probabilistic logic programs. 355-388 - Yann Loyer, Umberto Straccia:
Approximate well-founded semantics, query answering and generalized normal logic programs over lattices. 389-417
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.