SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Electronic Notes in Theoretical Computer Science

Volumn 125, Issue 3, 2005, Pages 69-85

Justifying equality

(3) De Moura, Leonardo a Rueß, Harald a Shankar, Natarajan a

a SRI INTERNATIONAL (United States)

Author keywords

Congruence Closure; Decision Procedures; Minimal Proofs; Proof Theory; Satisfiability; Union Find

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER SOFTWARE; DECISION THEORY; FUNCTIONS; MATRIX ALGEBRA; THEOREM PROVING;

CONGRUENCE CLOSURE; DECISION PROCEDURES; MINIMAL PROOFS; PROOF THEORY; SATISFIABILITY; UNION-FIND;

SET THEORY;

EID: 21644431749 PISSN: 15710661 EISSN: None Source Type: Journal
DOI: 10.1016/j.entcs.2004.06.068 Document Type: Conference Paper

Times cited : (9)

References (13)

1
- 84937429063
- Abstract congruence closure and specializations
- D. McAllester, Automated Deduction - CADE-17, Springer
- L. Bachmair, and A. Tiwari Abstract congruence closure and specializations D. McAllester Automated Deduction - CADE-17 LNAI volume 1831 June 2000 Springer 64 78
- (2000) LNAI , vol.1831 , pp. 64-78
- Bachmair, L.¹ Tiwari, A.²

2
- 84937569311
- Checking satisfiability of first-order formulas by incremental translation to SAT
- Computer-Aided Verification, CAV '2002 Springer. July
- C.W. Barrett, D.L. Dill, and A. Stump Checking satisfiability of first-order formulas by incremental translation to SAT Computer-Aided Verification CAV '2002 LNCS volume 2404 July 2002 Springer 236 249
- (2002) LNCS , vol.2404 , pp. 236-249
- Barrett, C.W.¹ Dill, D.L.² Stump, A.³

3
- 0004116989
- The MIT Press Cambridge, MA
- T.H. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1990 The MIT Press Cambridge, MA
- (1990) Introduction to Algorithms
- Cormen, T.H.¹ Leiserson, C.E.² Rivest, R.L.³

4
- 84948134383
- Counter-example based predicate discovery in predicate abstraction
- Formal Methods in Computer-Aided Design, Springer
- S. Das, and D.L. Dill Counter-example based predicate discovery in predicate abstraction Formal Methods in Computer-Aided Design LNCS November 2002 Springer 19 32
- (2002) LNCS , pp. 19-32
- Das, S.¹ Dill, D.L.²

5
- 24144441847
- Lemmas on demand for satisfiability solvers
- May Extended version at
- L. de Moura and H. Rueß. Lemmas on demand for satisfiability solvers. In Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT'02), May 2002. Extended version at http://www.csl.sri.com/users/ruess/papers/SAT2002/index.html
- (2002) Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT'02)
- De Moura, L.¹ Rueß, H.²

6
- 84948958346
- Lazy theorem proving for bounded model checking over infinite domains
- A. Voronkov, International Conference on Automated Deduction, (CADE'02),Springer, July
- L. de Moura, H. Rueß, and M. Sorea Lazy theorem proving for bounded model checking over infinite domains A. Voronkov International Conference on Automated Deduction (CADE'02) LNCS volume 2392 July 2002 Springer 438 455
- (2002) LNCS , vol.2392 , pp. 438-455
- De Moura, L.¹ Rueß, H.² Sorea, M.³

7
- 0002986443
- Witnesses for boolean matrix multiplication and for transitive closure
- Z. Galil, and O. Margalit Witnesses for boolean matrix multiplication and for transitive closure Journal of Complexity 9 1993 201 221
- (1993) Journal of Complexity , vol.9 , pp. 201-221
- Galil, Z.¹ Margalit, O.²

8
- 84947715642
- Shostak's congruence closure as completion
- H. Comon, Rewriting Techniques and Applications, RTA 1997, Springer
- D. Kapur Shostak's congruence closure as completion H. Comon Rewriting Techniques and Applications, RTA 1997 LNCS volume 1103 July 1997 Springer 23 37
- (1997) LNCS , vol.1103 , pp. 23-37
- Kapur, D.¹

9
- 84947295252
- Combining Shostak theories
- S. Tison, RTA'02. Springer
- N. Shankar, and H. Rueß Combining Shostak theories S. Tison RTA'02 LNCS volume 2378 2002 Springer 1 18
- (2002) LNCS , vol.2378 , pp. 1-18
- Shankar, N.¹ Rueß, H.²

10
- 0004031733
- Addison-Wesley Reading, MA
- J.R. Shoenfield Mathematical Logic 1967 Addison-Wesley Reading, MA
- (1967) Mathematical Logic
- Shoenfield, J.R.¹

11
- 0016495233
- Efficiency of a good but not linear set union algorithm
- R.E. Tarjan Efficiency of a good but not linear set union algorithm Journal of the ACM 1975 215 225
- (1975) Journal of the ACM , pp. 215-225
- Tarjan, R.E.¹

12
- 21644435719
- Personal communication. June
- A. Tiwari. Personal communication. June 2004
- (2004)
- Tiwari, A.¹

13
- 84880678649
- The LPSAT engine: Its application to resource planning
- S.A. Wolfman and D.S. Weld. The LPSAT engine: Its application to resource planning. In IJCAI, pages 310-317, 1999
- (1999) IJCAI , pp. 310-317
- Wolfman, S.A.¹ Weld, D.S.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.