-
1
-
-
26444438151
-
Simplifying diagnosis using LSAT: A propositional approach to reasoning from first principles
-
Barták, R., and Milano, M., eds., Proceedings of the 2005 International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR), Berlin, Heidelberg: Springer-Verlag
-
Bauer, A. 2005. Simplifying diagnosis using LSAT: a propositional approach to reasoning from first principles. In Barták, R., and Milano, M., eds., Proceedings of the 2005 International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR), volume 3524 of Lecture Notes in Computer Science, 49-63. Berlin, Heidelberg: Springer-Verlag.
-
(2005)
Lecture Notes in Computer Science
, vol.3524
, pp. 49-63
-
-
Bauer, A.1
-
2
-
-
0002946365
-
Combinatorial profiles of sequential benchmark circuits
-
and of North Carolina, M. C.
-
Brglez, F.; Bryan, D.; Kozminski, K.; and of North Carolina, M. C. 1989. Combinatorial profiles of sequential benchmark circuits. MCNC technical report.
-
(1989)
MCNC Technical Report
-
-
Brglez, F.1
Bryan, D.2
Kozminski, K.3
-
3
-
-
0026151569
-
The computational complexity of abduction
-
Bylander, T.; Allemang, D.; Tanner, M. C.; and Josephson, J. R. 1991. The computational complexity of abduction. Artif. Intell. 49(1-3):25-60.
-
(1991)
Artif. Intell.
, vol.49
, Issue.1-3
, pp. 25-60
-
-
Bylander, T.1
Allemang, D.2
Tanner, M.C.3
Josephson, J.R.4
-
4
-
-
0041648567
-
Symmetry-breaking predicates for search problems
-
Crawford, J. M.; Ginsberg, M. L.; Luks, E. M.; and Roy, A. 1996. Symmetry-breaking predicates for search problems. In KR, 148-159.
-
(1996)
KR
, pp. 148-159
-
-
Crawford, J.M.1
Ginsberg, M.L.2
Luks, E.M.3
Roy, A.4
-
5
-
-
2942697066
-
Decomposable negation normal form
-
Darwiche, A. 2001. Decomposable negation normal form. Journal of the ACM 48(4):608-647.
-
(2001)
Journal of the ACM
, vol.48
, Issue.4
, pp. 608-647
-
-
Darwiche, A.1
-
8
-
-
33749557305
-
Translating pseudoBoolean constraints into sat
-
Eén, N., and Sörensson, N. 2006. Translating pseudoBoolean constraints into sat. JSAT 2(1-4): 1-26.
-
(2006)
JSAT
, vol.2
, Issue.1-4
, pp. 1-26
-
-
Eén, N.1
Sörensson, N.2
-
9
-
-
84868296879
-
A two-step hierarchical algorithm for model-based diagnosis
-
Feldman, A., and van Gemund, A. J. C. 2006. A two-step hierarchical algorithm for model-based diagnosis. In AAAI.
-
(2006)
AAAI
-
-
Feldman, A.1
Van Gemund, A.J.C.2
-
10
-
-
84868281056
-
Solving model-based diagnosis problems with max-sat solvers and vice versa
-
Feldman, A.; Provan, G.; de Kleer, J.; Robert, S.; and van Gemund, A. 2010. Solving model-based diagnosis problems with max-sat solvers and vice versa. In Proceedings of the 21th International Workshop on Principles of Diagnosis (DX-10), 185-192.
-
(2010)
Proceedings of the 21th International Workshop on Principles of Diagnosis (DX-10)
, pp. 185-192
-
-
Feldman, A.1
Provan, G.2
De Kleer, J.3
Robert, S.4
Van Gemund, A.5
-
11
-
-
77957885037
-
Approximate model-based diagnosis using greedy stochastic search
-
Feldman, A.; Provan, G.; and van Gemund, A. 2010. Approximate model-based diagnosis using greedy stochastic search. J. Artif. Int. Res. 38:371-413.
-
(2010)
J. Artif. Int. Res.
, vol.38
, pp. 371-413
-
-
Feldman, A.1
Provan, G.2
Van Gemund, A.3
-
12
-
-
0033359923
-
Unveiling the iscas-85 benchmarks: A case study in reverse engineering
-
Hansen, M. C.; Yalcin, H.; and Hayes, J. P. 1999. Unveiling the iscas-85 benchmarks: A case study in reverse engineering. IEEE Des. Test 16:72-80.
-
(1999)
IEEE Des. Test
, vol.16
, pp. 72-80
-
-
Hansen, M.C.1
Yalcin, H.2
Hayes, J.P.3
-
13
-
-
0023211128
-
A topological search algorithm for atpg
-
New York, NY, USA: ACM
-
Kirkland, T., and Mercer, M. R. 1987. A topological search algorithm for atpg. In Proceedings of the 24th ACM/IEEE Design Automation Conference, DAC '87, 502-508. New York, NY, USA: ACM.
-
(1987)
Proceedings of the 24th ACM/IEEE Design Automation Conference, DAC '87
, pp. 502-508
-
-
Kirkland, T.1
Mercer, M.R.2
-
14
-
-
80053014980
-
Boolean equi-propagation for optimized sat encoding
-
Lee, J. H.-M., ed., CP, Springer
-
Metodi, A.; Codish, M.; Lagoon, V.; and Stuckey, P. J. 2011. Boolean equi-propagation for optimized sat encoding. In Lee, J. H.-M., ed., CP, volume 6876 of Lecture Notes in Computer Science, 621-636. Springer.
-
(2011)
Lecture Notes in Computer Science
, vol.6876
, pp. 621-636
-
-
Metodi, A.1
Codish, M.2
Lagoon, V.3
Stuckey, P.J.4
-
17
-
-
0023329093
-
A theory of diagnosis from first principles
-
Reiter, R. 1987. A theory of diagnosis from first principles. Artificial Intelligence 32(1):57-96.
-
(1987)
Artificial Intelligence
, vol.32
, Issue.1
, pp. 57-96
-
-
Reiter, R.1
-
18
-
-
85157984300
-
Abductive and default reasoning: A computational core
-
Selman, B., and Levesque, H. J. 1990. Abductive and default reasoning: A computational core. In AAAI, 343-348.
-
(1990)
AAAI
, pp. 343-348
-
-
Selman, B.1
Levesque, H.J.2
-
19
-
-
84880879826
-
Hierarchical diagnosis of multiple faults
-
Siddiqi, S. A., and Huang, J. 2007. Hierarchical diagnosis of multiple faults. In IJCAI, 581-586.
-
(2007)
IJCAI
, pp. 581-586
-
-
Siddiqi, S.A.1
Huang, J.2
-
20
-
-
84868269496
-
Computing minimum-cardinality diagnoses by model relaxation
-
Siddiqi, S. A. 2011. Computing minimum-cardinality diagnoses by model relaxation. In IJCAI, 1087-1092.
-
(2011)
IJCAI
, pp. 1087-1092
-
-
Siddiqi, S.A.1
-
21
-
-
27144460537
-
Fault diagnosis and logic debugging using Boolean satisfiability
-
Smith, E.; Veneris, A.; Member, S.; Ali, M. F.; Member, S.; Member, S.; and Viglas, A. 2005. Fault diagnosis and logic debugging using Boolean satisfiability. IEEE Trans. on CAD 24:1606-1621.
-
(2005)
IEEE Trans. on CAD
, vol.24
, pp. 1606-1621
-
-
Smith, E.1
Veneris, A.2
Member, S.3
Ali, M.F.4
Member, S.5
Member, S.6
Viglas, A.7
-
22
-
-
84864217223
-
-
v2.5.1
-
Soos, M. 2010. Cryptominisat, v2.5.1. http://www.msoos.org/ cryptominisat2.
-
(2010)
Cryptominisat
-
-
Soos, M.1
-
23
-
-
38049101382
-
Speeding up model-based diagnosis by a heuristic approach to solving sat
-
Anaheim, CA, USA: ACTA Press
-
Stein, B.; Niggemann, O.; and Lettmann, T. 2006. Speeding up model-based diagnosis by a heuristic approach to solving sat. In Proceedings of the 24th IASTED international conference on Artificial intelligence and applications, 273-278. Anaheim, CA, USA: ACTA Press.
-
(2006)
Proceedings of the 24th IASTED International Conference on Artificial Intelligence and Applications
, pp. 273-278
-
-
Stein, B.1
Niggemann, O.2
Lettmann, T.3
-
25
-
-
34250164602
-
Conflict-directed A* and its role in model-based embedded systems
-
Williams, B. C., and Ragno, R. J. 2007. Conflict-directed A* and its role in model-based embedded systems. Discrete Appl. Math. 155(12):1562-1595.
-
(2007)
Discrete Appl. Math.
, vol.155
, Issue.12
, pp. 1562-1595
-
-
Williams, B.C.1
Ragno, R.J.2
|