Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Klaus Truemper"'
Publikováno v:
Journal on Satisfiability, Boolean Modeling and Computation. 6:13-32
A simple model of signal transduction networks in molecular biology consists of CNF formulas with two and three literals per clause. A necessary condition for correctness of the network model is satisfiability of the formulas. Deciding satisfiability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00cd13c83fc86ef41e102ff67ae67cf4
https://doi.org/10.3233/sat190060
https://doi.org/10.3233/sat190060
Autor:
Anja Remshagen, Klaus Truemper
Publikováno v:
Journal of Automated Reasoning. 34:31-47
In the futile questioning problem, one must decide whether acquisition of additional information can possibly lead to the proof of a conclusion. Solution of that problem demands evaluation of a quantified Boolean formula at the second level of the po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73b999e6d8c484b4c35819be5da08737
https://doi.org/10.1007/s10817-005-0981-8
https://doi.org/10.1007/s10817-005-0981-8
Autor:
Klaus Truemper, Giovanni Felici
Publikováno v:
INFORMS journal on computing 14 (2002): 20–36.
info:cnr-pdr/source/autori:Felici, G.; Truemper, K./titolo:A MINSAT Approach for Learning in Logic Domains/doi:/rivista:INFORMS journal on computing/anno:2002/pagina_da:20/pagina_a:36/intervallo_pagine:20–36/volume:14
info:cnr-pdr/source/autori:Felici, G.; Truemper, K./titolo:A MINSAT Approach for Learning in Logic Domains/doi:/rivista:INFORMS journal on computing/anno:2002/pagina_da:20/pagina_a:36/intervallo_pagine:20–36/volume:14
This paper describes a method for learning logic relationships that correctly classify a given data set. The method derives from given logic data certain minimum cost satisfiability problems, solves these problems, and deduces from the solutions the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7bc61b6b6c4fad07a33b75f7442f236
https://doi.org/10.1287/ijoc.14.1.20.7709
https://doi.org/10.1287/ijoc.14.1.20.7709
Autor:
Klaus Truemper, Y. Zhao
Publikováno v:
Applied Artificial Intelligence. 13:725-742
This paper describes a spell checking system that learns user behavior. Based on that insight, the system with high likelihood suggests correct replacements for incorrect words and declares unknown, but correct words to be correct. The system relies
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59793b431da788612b5821daeffd9b71
https://doi.org/10.1080/088395199117199
https://doi.org/10.1080/088395199117199
Autor:
Janell Straach, Klaus Truemper
Publikováno v:
Artificial Intelligence. 111(1-2):301-327
This paper describes an effective technique for relevant questioning in expert systems whose knowledge base is encoded in a propositional formula in conjunctive normal form. The methodology does not require initial knowledge about the relationships b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13f74ad5be17e30108aed18ad53ad82a
Autor:
Paul Seymour, Klaus Truemper
Publikováno v:
Journal of Combinatorial Theory, Series B. 72:63-79
LetGbe a cyclically 5-connected cubic graph, and letCbe a circuit ofGof length 5. We prove that if there is a subgraph ofGhomeomorphic to the Petersen graph, then there is one which in addition containsC. This greatly simplifies checking whetherGhas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fe6fa40646f4f6e45b359d5cf860ceb
https://doi.org/10.1006/jctb.1997.1791
https://doi.org/10.1006/jctb.1997.1791
Autor:
Matthias Walter, Klaus Truemper
This paper describes implementation and computational results of a polynomial test of total unimodularity. The test is a simplified version of a prior method. The program also decides two related unimodularity properties. The software is available fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ff0cf803561f27d42e838cba888a32e
http://arxiv.org/abs/1202.4061
http://arxiv.org/abs/1202.4061
Autor:
Jonathan Mugan, Klaus Truemper
Frequently, one wants to extend the use of a classification method that, in principle, requires records with True/False values, so that records with rational numbers can be processed. In such cases, the rational numbers must first be replaced by True
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93a9acf205b36667484f8554e754ffbe
https://doi.org/10.4018/978-1-59904-528-3.ch001
https://doi.org/10.4018/978-1-59904-528-3.ch001
Autor:
Klaus Truemper
Publikováno v:
Journal of Combinatorial Theory, Series B. 55:253-301
We introduce a new class of binary matroids called almost regular. Any such matroid is not regular, but for any element, at least one of the two minors produced by deletion and contraction of that element must be regular. Furthermore, certain labels
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::331cefa5112b5b0100a1cb69c2b9844e
https://doi.org/10.1016/0095-8956(92)90044-x
https://doi.org/10.1016/0095-8956(92)90044-x
Autor:
Klaus Truemper
Publikováno v:
Journal of Combinatorial Theory, Series B. 55(2):302-335
Let P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is maintained under submatrix taking, row and column permutations, scaling, and pivots, and when a row or column unit vector is adjoined. We propose a general m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9db025a8bfa307768f88b11e0379559