Home

Teaching

Research

Personal

Research Interests     Publications     Benchmarks

Journals

• H. Kleine Buning and A. Remshagen: An upper bound for the circuit complexity of existentially quantified Boolean formulas.
  Theoretical Computer Science 411(31-33), 2864-2870, 2010
• A. Remshagen and K. Truemper: An Effective Algorithm for the Futile Questioning Problem.
  Journal of Automated Reasoning 34(1), 31-47, 2005
• A. Remshagen and K. Truemper: Learning in a Compiler for MINSAT Algorithms.
  Theory and Practice of Logic Programming 3(3), 271-286, 2003
   

Conferences and Workshops

• A. Remshagen: Q-MIN UNSAT: An Optimization Problem for Quantified Boolean Formulas.
  Proc. of thw IADIS International Conference Intelligent Systems and Agents, 2011
• U. Bubeck, H. Kleine Büning, A. Remshagen, and X. Zhao: Expressiveness and Complexity of Subclasses of Quantified Boolean Formulas.
  Workshop on Propositional Proof Complexity, Federated Logic Conference (FLoC) 2010
• A. Remshagen: The Complexity of Constrained Quantified Formulas.
  Proc. of thw IADIS International Conference Intelligent Systems and Agents, 35-42, 2010
• A. Remshagen: Making Discrete Mathematics Relevant.
  Proc. of the 48th ACM Southeast Conference, 2010
• A. Remshagen and K. Truemper: An Alternative Representation for QBF.
  Proc. of the International Conference on Artificial Intelligence (ICAI 2009), 531-535, 2009
• A. Remshagen and K. Truemper: The Complexity of Futile Questioning.
  Proc. of the International Conference on Foundations in Computer Science, 132-138, 2007
• A. Remshagen and K. Truemper: Algorithms for Q-ALL SAT with Learning via Heuristics.
  11th Combinatorial Optimization Workshop, Aussois, France, 2007
• B. Browning and A. Remshagen: A SAT-based Solver for Q-ALL SAT.
  Proc. of the 44th ACM Southeast Conference, 30-33, 2006
• K. Moreland, A. Remshagen, and K. Riehl: An Intelligent System for Medical Diagnosis.
  Grace Hopper Celebration of Women in Computing, 2006
• N. Hristov and A. Remshagen: Local Search for Quantified Boolean Formula.
  Proc. of the 43rd ACM Southeast Conference (1), 116-120, 2005
• C. Otwell, A. Remshagen, and K. Truemper: An Effective QBF Solver for Planning Problems.
  Proc. of the International Conference on Algorithmic Mathematics and
  Computer Science, 311-316, 2004
• V. Kaibel and A. Remshagen: On the Graph-Density of Random 0/1-Polytopes.
  (Proc. RANDOM03), Arora, Jansen, Roli, and Sahai (eds.), LNCS 2764, Springer, 318-328, 2003
• A. Remshagen and K. Truemper: Algorithms for Logic-Based Abduction.
  SAT 2002, Quantified Boolean Formulas Mini Workshop, 2002
  
• A. Remshagen and K. Truemper: Learning in a Compiler for SAT and MINSAT Algorithms - A Summary.
  IJCAR 2001 - Short Papers
   

Technical Reports

• A. Remshagen: On the Complexity of the CQF Hierachy.
  Working Paper, 2007
• G. Felici, A. Remshagen, and K. Truemper: The Futile Questioning Problem.
  IASI Research Report n. 591, Rome, Italy, Luglio 2003
   

UWG Disclaimer  Anja Remshagen Last modified: Aug 11, 2011