-
1
-
-
23944472232
-
Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
-
J. Bailey and P. Stuckey. Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In Proceedings of PADL'05, pages 174-186, 2005.
-
(2005)
Proceedings of PADL'05
, pp. 174-186
-
-
Bailey, J.1
Stuckey, P.2
-
2
-
-
0042654803
-
Iterated Syntax-Based Revision in a Non-monotonic Setting
-
Frontiers in Belief Revision
-
B. Bessant, É Grégoire, P. Marquis, and L. Saïs. Iterated Syntax-Based Revision in a Non-monotonic Setting, volume 22 of Applied Logic, pages 369-391. Frontiers in Belief Revision, 2001.
-
(2001)
Applied Logic
, vol.22
, pp. 369-391
-
-
Bessant, B.1
Grégoire, É.2
Marquis, P.3
Saïs, L.4
-
3
-
-
0042014224
-
Approximating minimal unsatisfiable subformulae by means of adaptive core search
-
R. Bruni. Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Applied Mathematics, 130(2):85-100, 2003.
-
(2003)
Discrete Applied Mathematics
, vol.130
, Issue.2
, pp. 85-100
-
-
Bruni, R.1
-
4
-
-
10344223023
-
On exact selection of minimally unsatisfiable subformulae
-
DOI 10.1007/s10472-004-9418-z
-
R. Bruni. On exact selection of minimally unsatisfiable subformulae. Annals of Mathematics and Artificial Intelligence, 43(1):35-50, 2005. (Pubitemid 39631109)
-
(2005)
Annals of Mathematics and Artificial Intelligence
, vol.43
, Issue.1-4
, pp. 35-50
-
-
Bruni, R.1
-
5
-
-
0000781361
-
On subclasses of minimal unsatisfiable formulas
-
H. Büning. On subclasses of minimal unsatisfiable formulas. Discrete Applied Mathematics, 107(1-3):83-98, 2000.
-
(2000)
Discrete Applied Mathematics
, vol.107
, Issue.1-3
, pp. 83-98
-
-
Büning, H.1
-
6
-
-
22444455509
-
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
-
G. Davydov, I. Davydova, and H.K. Büning. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Annals of Mathematics and Artificial Intelligence, 23(3-4):229-245, 1998. (Pubitemid 128696760)
-
(1998)
Annals of Mathematics and Artificial Intelligence
, vol.23
, Issue.3-4
, pp. 229-245
-
-
Davydov, G.1
-
8
-
-
0026940077
-
On the complexity of propositional knowledge base revision, updates, and counterfactuals and counterfactuals
-
T. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates and counterfactual. Artificial Intelligence, 57:227-270, 1992. (Pubitemid 23586698)
-
(1992)
Artificial Intelligence
, vol.57
, Issue.2-3
, pp. 227-270
-
-
Eiter, T.1
Gottlob, G.2
-
9
-
-
57649214960
-
-
home page
-
N. Eén and N. Sörensson. MiniSat home page: http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat.
-
MiniSat
-
-
Eén, N.1
Sörensson, N.2
-
10
-
-
0037163958
-
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
-
H. Fleischner, O. Kullman, and S. Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoretical Computer Science, 289(1):503-516, 2002.
-
(2002)
Theoretical Computer Science
, vol.289
, Issue.1
, pp. 503-516
-
-
Fleischner, H.1
Kullman, O.2
Szeider, S.3
-
14
-
-
84880904224
-
-
home page
-
H. Kautz and B. Selman. Walksat home page: http://www.cs.washington.edu/ homes/kautz/walksat.
-
Walksat
-
-
Kautz, H.1
Selman, B.2
-
15
-
-
26444450510
-
On finding all minimally unsatisfiable subformulas
-
M. Liffiton and K. Sakallah. On finding all minimally unsatisfiable subformulas. In Proceedings of SAT'05, pages 173-186, 2005.
-
(2005)
Proceedings of SAT'05
, pp. 173-186
-
-
Liffiton, M.1
Sakallah, K.2
-
17
-
-
4444353562
-
AMUSE: A minimally-unsatisfiable subformula extractor
-
Y. Oh, M. Mneimneh, Z. Andraus, K. Sakallah, and I. Markov. AMUSE: a minimally-unsatisfiable subformula extractor. In Proceedings of DAC'04, pages 518-523, 2004.
-
(2004)
Proceedings of DAC'04
, pp. 518-523
-
-
Oh, Y.1
Mneimneh, M.2
Andraus, Z.3
Sakallah, K.4
Markov, I.5
-
20
-
-
26444605769
-
Extracting small unsatisfiable cores from unsatisfiable boolean formula
-
L. Zhang and S. Malik. Extracting small unsatisfiable cores from unsatisfiable boolean formula. In Proceedings of SAT'03, 2003.
-
Proceedings of SAT'03, 2003
-
-
Zhang, L.1
Malik, S.2
-
21
-
-
26444481567
-
On subsumption removal and on-the-fly cnf simplification
-
L. Zhang. On subsumption removal and on-the-fly cnf simplification. In Proceedings of SAT'05, pages 482-489, 2005.
-
(2005)
Proceedings of SAT'05
, pp. 482-489
-
-
Zhang, L.1
|