Home
Teaching
Research
Personal
Research Interests
Publications
Benchmarks
Journals
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 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: Nov 20, 2007