Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-5
|
Results: 5
On subclasses of minimal unsatisfiable formulas
Authors:
Buning, HK
Citation:
Hk. Buning, On subclasses of minimal unsatisfiable formulas, DISCR APP M, 107(1-3), 2000, pp. 83-98
Complexity results for restricted credulous default reasoning
Authors:
Zhao, XS Ding, DC Buning, HK
Citation:
Xs. Zhao et al., Complexity results for restricted credulous default reasoning, AI COMMUN, 13(4), 2000, pp. 249-257
Preface - Special issue of DAM on the Satisfiability Problem
Authors:
Franco, JV Gallo, G Buning, HK Speckenmeyer, E
Citation:
Jv. Franco et al., Preface - Special issue of DAM on the Satisfiability Problem, DISCR APP M, 97, 1999, pp. 1-2
Resolution remains hard under equivalence
Authors:
Buning, HK Lettmann, T
Citation:
Hk. Buning et T. Lettmann, Resolution remains hard under equivalence, DISCR APP M, 97, 1999, pp. 139-148
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Authors:
Davydov, G Davydova, I Buning, HK
Citation:
G. Davydov et al., An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF, ANN MATH A, 23(3-4), 1998, pp. 229-245
Risultati:
1-5
|