The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Klaus Truemper: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Giovanni Felici, Giovanni Rinaldi, Klaus Truemper
    FasTraC: A Decentralized Traffic Control System Based on Logic Programming. [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:216-220 [Conf]
  2. Giovanni Felici, Fushing Sun, Klaus Truemper
    A Method for Controlling Errors in Two-Class Classification. [Citation Graph (0, 0)][DBLP]
    COMPSAC, 1999, pp:186-191 [Conf]
  3. Charles Otwell, Anja Remshagen, Klaus Truemper
    An Effective QBF Solver for Planning Problems. [Citation Graph (0, 0)][DBLP]
    MSV/AMCS, 2004, pp:311-316 [Conf]
  4. Y. Zhao, Klaus Truemper
    Effective Spell Checking by Learning User Behavior. [Citation Graph (0, 0)][DBLP]
    Applied Artificial Intelligence, 1999, v:13, n:8, pp:725-742 [Journal]
  5. Janell Straach, Klaus Truemper
    Learning to Ask Relevant Questions. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:111, n:1-2, pp:301-327 [Journal]
  6. Anja Remshagen, Klaus Truemper
    Learning in a Compiler for MINSAT Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  7. Giovanni Felici, Klaus Truemper
    A MINSAT Approach for Learning in Logic Domains. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2002, v:14, n:1, pp:20-36 [Journal]
  8. Anja Remshagen, Klaus Truemper
    An Effective Algorithm for the Futile Questioning Problem. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2005, v:34, n:1, pp:31-47 [Journal]
  9. Martin Grötschel, Klaus Truemper
    Decomposition and optimization over cycles in binary matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:3, pp:306-337 [Journal]
  10. Paul D. Seymour, Klaus Truemper
    A Petersen on a Pentagon. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:63-79 [Journal]
  11. Klaus Truemper
    Alpha-balanced graphs and matrices and GF(3)-representability of matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:32, n:2, pp:112-139 [Journal]
  12. Klaus Truemper
    A decomposition theory for matroids. I. General results. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:1, pp:43-76 [Journal]
  13. Klaus Truemper
    A decomposition theory for matroids. II. Minimal violation matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:3, pp:282-297 [Journal]
  14. Klaus Truemper
    A decomposition theory for matroids III. Decomposition conditions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:3, pp:275-305 [Journal]
  15. Klaus Truemper
    A decomposition theory for matroids IV. Decomposition of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:3, pp:259-292 [Journal]
  16. Klaus Truemper
    A decomposition theory for matroids. V. Testing of matrix total unimodularity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:49, n:2, pp:241-281 [Journal]
  17. Klaus Truemper
    A decomposition theory for matroids. VI. Almost regular matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:55, n:2, pp:253-301 [Journal]
  18. Klaus Truemper
    A decomposition theory for matroids. VII. Analysis of minimal violation matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:55, n:2, pp:302-335 [Journal]
  19. Anja Remshagen, Klaus Truemper
    Learning in a Compiler for MINSAT Algorithms. [Citation Graph (0, 0)][DBLP]
    TPLP, 2003, v:3, n:3, pp:271-286 [Journal]

  20. The Complexity of Futile Questioning. [Citation Graph (, )][DBLP]


  21. An Alternative Representation for QBF. [Citation Graph (, )][DBLP]


  22. The Needles-in-Haystack Problem. [Citation Graph (, )][DBLP]


  23. Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization. [Citation Graph (, )][DBLP]


  24. Discretization of Target Attributes for Subgroup Discovery. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002