메뉴 건너뛰기




Volumn 4573 LNAI, Issue , 2007, Pages 327-341

Alternative aggregates in MIZAR

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; VECTORS;

EID: 38049045534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73086-6_26     Document Type: Conference Paper
Times cited : (8)

References (28)
  • 1
    • 0036800445 scopus 로고    scopus 로고
    • Geuvers, H., Pollack, R., Wiedijk, F.J.Z.: A constructive algebraic hierarchy in Coq. Journal of Symbolic Computation 34(4), 271-286 (2002), See also http://www.cs.ru.nl/~freek/pubs
    • Geuvers, H., Pollack, R., Wiedijk, F.J.Z.: A constructive algebraic hierarchy in Coq. Journal of Symbolic Computation 34(4), 271-286 (2002), See also http://www.cs.ru.nl/~freek/pubs
  • 2
    • 84937393619 scopus 로고    scopus 로고
    • Kammüller, F.: Modular reasoning in Isabelle. In: McAllester, D. (ed.) Automated Deduction - CADE-17. LNCS, 1831, Springer, Heidelberg (2000), See also http://swt.cs.tu-berlin.de/~flokam
    • Kammüller, F.: Modular reasoning in Isabelle. In: McAllester, D. (ed.) Automated Deduction - CADE-17. LNCS, vol. 1831, Springer, Heidelberg (2000), See also http://swt.cs.tu-berlin.de/~flokam
  • 3
    • 38049000104 scopus 로고    scopus 로고
    • Kammüller, F.: Comparison of imps, pvs and larch with respect to theory treatment and modularization. Technical report, TU Berlin, Unpublished (1996) see http://swt.cs.tu-berlin.de/~flokam
    • Kammüller, F.: Comparison of imps, pvs and larch with respect to theory treatment and modularization. Technical report, TU Berlin, Unpublished (1996) see http://swt.cs.tu-berlin.de/~flokam
  • 4
    • 17044413421 scopus 로고    scopus 로고
    • Coquand, T., Pollack, R., Takeyama, M.: A logical framework with dependently typed records. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, 2701, Springer, Heidelberg (2003)
    • Coquand, T., Pollack, R., Takeyama, M.: A logical framework with dependently typed records. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol. 2701, Springer, Heidelberg (2003)
  • 5
    • 38049090100 scopus 로고    scopus 로고
    • Wenzel, M.: The Isabelle/Isar Reference Manual (2005) See http://isabelle.in.tum.de/doc/isar-ref.pdf
    • Wenzel, M.: The Isabelle/Isar Reference Manual (2005) See http://isabelle.in.tum.de/doc/isar-ref.pdf
  • 7
    • 38049065719 scopus 로고    scopus 로고
    • Trybulec, A.: Some Features of the Mizar Language. Technical report, ESPRIT Workshop, Torino (1993) See also http://mizar.org/project/trybulec93.ps
    • Trybulec, A.: Some Features of the Mizar Language. Technical report, ESPRIT Workshop, Torino (1993) See also http://mizar.org/project/trybulec93.ps
  • 9
    • 35248861729 scopus 로고    scopus 로고
    • Vertex sequences induced by chains
    • Nakamura, Y., Rudnicki, P.: Vertex sequences induced by chains. Formalized Mathematics 5(3), 297-304 (1996)
    • (1996) Formalized Mathematics , vol.5 , Issue.3 , pp. 297-304
    • Nakamura, Y.1    Rudnicki, P.2
  • 12
    • 38049087843 scopus 로고    scopus 로고
    • The underlying principle of Dijkstra's shortest path algorithm
    • Nakamura, Y., Chen, J.C.: The underlying principle of Dijkstra's shortest path algorithm. Formalized Mathematics 11(2), 143-152 (2003)
    • (2003) Formalized Mathematics , vol.11 , Issue.2 , pp. 143-152
    • Nakamura, Y.1    Chen, J.C.2
  • 13
    • 26844485019 scopus 로고    scopus 로고
    • Dijkstra's shortest path algorithm
    • Chen, J.C.: Dijkstra's shortest path algorithm. Formalized Mathematics 11(3), 237-248 (2003)
    • (2003) Formalized Mathematics , vol.11 , Issue.3 , pp. 237-248
    • Chen, J.C.1
  • 14
    • 38049010239 scopus 로고    scopus 로고
    • The correspondence between monotonie many sorted signatures and well-founded graphs. Part I
    • Byliński, C., Rudnicki, P.: The correspondence between monotonie many sorted signatures and well-founded graphs. Part I. Journal of Formalized Mathematics, vol. 8 (1996)
    • (1996) Journal of Formalized Mathematics , vol.8
    • Byliński, C.1    Rudnicki, P.2
  • 15
    • 38049010239 scopus 로고    scopus 로고
    • The correspondence between monotonic many sorted signatures and well-founded graphs. Part II
    • Byliński, C., Rudnicki, P.: The correspondence between monotonic many sorted signatures and well-founded graphs. Part II. Journal of Formalized Mathematics, vol. 8 (1996)
    • (1996) Journal of Formalized Mathematics , vol.8
    • Byliński, C.1    Rudnicki, P.2
  • 17
    • 38049024279 scopus 로고    scopus 로고
    • Weighted and labeled graphs
    • Lee, G.: Weighted and labeled graphs. Formalized Mathematics 13(2), 279-293 (2005)
    • (2005) Formalized Mathematics , vol.13 , Issue.2 , pp. 279-293
    • Lee, G.1
  • 18
    • 38049060936 scopus 로고    scopus 로고
    • Correctness of Dijkstra's shortest path and Prim's minimum spanning tree algorithms
    • Lee, G., Rudnicki, P.: Correctness of Dijkstra's shortest path and Prim's minimum spanning tree algorithms. Formalized Mathematics 13(2), 295-304 (2005)
    • (2005) Formalized Mathematics , vol.13 , Issue.2 , pp. 295-304
    • Lee, G.1    Rudnicki, P.2
  • 19
    • 38049042086 scopus 로고    scopus 로고
    • Alternative graph structures
    • Lee, G., Rudnicki, P.: Alternative graph structures. Formalized Mathematics 13(2), 235-252 (2005)
    • (2005) Formalized Mathematics , vol.13 , Issue.2 , pp. 235-252
    • Lee, G.1    Rudnicki, P.2
  • 20
    • 38049094489 scopus 로고    scopus 로고
    • Walks in graphs
    • Lee, G.: Walks in graphs. Formalized Mathematics 13(2), 253-269 (2005)
    • (2005) Formalized Mathematics , vol.13 , Issue.2 , pp. 253-269
    • Lee, G.1
  • 21
    • 38049031421 scopus 로고    scopus 로고
    • Trees and graph components
    • Lee, G.: Trees and graph components. Formalized Mathematics 13(2), 271-277 (2005)
    • (2005) Formalized Mathematics , vol.13 , Issue.2 , pp. 271-277
    • Lee, G.1
  • 22
    • 38049075088 scopus 로고    scopus 로고
    • Lee, G.: Verification of Graph Algorithms in Mizar. Master's thesis, University of Alberta, Dept. of Comp. Sci. (2004) See also http://www.cs. ualberta.ca/~piotr/Mizar
    • Lee, G.: Verification of Graph Algorithms in Mizar. Master's thesis, University of Alberta, Dept. of Comp. Sci. (2004) See also http://www.cs. ualberta.ca/~piotr/Mizar
  • 23
    • 84984809005 scopus 로고    scopus 로고
    • Correctnesss of Ford-Fulkerson's maximum now algorithm
    • Lee, G.: Correctnesss of Ford-Fulkerson's maximum now algorithm. Formalized Mathematics 13(2), 305-314 (2005)
    • (2005) Formalized Mathematics , vol.13 , Issue.2 , pp. 305-314
    • Lee, G.1
  • 24
    • 38049044614 scopus 로고    scopus 로고
    • Arneson, B.: Mizar Verification of Algorithms for Recognizing Chordal Graphs. Master's thesis, University of Alberta, Dept. of Comp. Sci. (2007) See also http://www.cs.ualberta.ca/~piotr/Mizar
    • Arneson, B.: Mizar Verification of Algorithms for Recognizing Chordal Graphs. Master's thesis, University of Alberta, Dept. of Comp. Sci. (2007) See also http://www.cs.ualberta.ca/~piotr/Mizar
  • 26
    • 0021473698 scopus 로고
    • Simplie linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
    • Tarjan, R.E., Yannakakis, M.: Simplie linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal of Computing 13(3), 566-569 (1984)
    • (1984) SIAM Journal of Computing , vol.13 , Issue.3 , pp. 566-569
    • Tarjan, R.E.1    Yannakakis, M.2
  • 28
    • 38049071919 scopus 로고    scopus 로고
    • Recognizing chordal graphs: Lex BFS and MCS
    • Arneson, B., Rudnicki, P.: Recognizing chordal graphs: Lex BFS and MCS. Formalized Mathematics 14(4), 187-205 (2006)
    • (2006) Formalized Mathematics , vol.14 , Issue.4 , pp. 187-205
    • Arneson, B.1    Rudnicki, P.2


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