#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2003

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Anja Remshagen, Klaus Truemper
- FCS
- 2007

Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified Boolean formula. Aâ€¦ (More)

- Charles Otwell, Anja Remshagen, Klaus Truemper
- MSV/AMCS
- 2004

A large number of applications can be represented by quantified Boolean formulas (QBF). Although evaluating QBF is NP-hard and thus very difficult, there has been significant progress in theâ€¦ (More)

- Anja Remshagen
- ACM Southeast Regional Conference
- 2010

Discrete mathematics is an important foundation of computer science. Especially during the last decade, resources for instructors have been designed to meet the needs in computer science education.â€¦ (More)

- Ben Browning, Anja Remshagen
- ACM Southeast Regional Conference
- 2006

Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand to solve even moreâ€¦ (More)

- Hans Kleine BÃ¼ning, Anja Remshagen
- Theor. Comput. Sci.
- 2010

- Anja Remshagen, Klaus Truemper
- TPLP
- 2003

This paper describes learning in a compiler for algorithms solving classes of the logic minimization problem MINSAT, where the underlying propositional formula is in conjunctive normal form (CNF) andâ€¦ (More)

- Anja Remshagen
- 2007

where allRi and S are formulas in conjunctive normal form (CNF), and where in general all CNF formulas occurring in Fi contain the variable set Qi Each formula Fi is a Constrained Quantified Formulaâ€¦ (More)

- N. Hristov, Anja Remshagen
- ACM Southeast Regional Conference
- 2005

Emerging applications demand to solve problems that are considered to be more difficult than NP-complete problems. Evaluating a quantified Boolean formula (QBF) is one of those problems. For theâ€¦ (More)

- Anja Remshagen, Lei Yang
- CODASPY
- 2014

As access control models have become more complex, tools should be developed to support the maintenance of policies. We have adapted a powerful privacy-aware role-based access control model toâ€¦ (More)

- Volker Kaibel, Anja Remshagen
- RANDOM-APPROX
- 2003

Let Xd,n be an n-element subset of {0, 1} chosen uniformly at random, and denote by Pd,n := conv Xd,n its convex hull. Let âˆ†d,n be the density of the graph of Pd,n (i.e., the number ofâ€¦ (More)