메뉴 건너뛰기




Volumn 38, Issue 1, 1999, Pages 55-77

Set constructors, finite sets, and logical semantics

Author keywords

Finite sets; Freeness axioms; Herbrand structure; Logical consequence; Semantics; Set constructors; Set unification; Zermelo Fraenkel set theory

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; THEOREM PROVING;

EID: 0032738546     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10012-2     Document Type: Article
Times cited : (9)

References (29)
  • 9
    • 49549145605 scopus 로고
    • A unification algorithm for typed λ-calculus
    • G.P. Huet, A unification algorithm for typed λ-calculus, Theoret. Comput. Sci. 1(1) (1975) 27-57.
    • (1975) Theoret. Comput. Sci. , vol.1 , Issue.1 , pp. 27-57
    • Huet, G.P.1
  • 11
    • 0009345166 scopus 로고
    • Ph.D. dissertation. Department of Computer Science, SUNY-Buffalo
    • D. Jana, Semantics of Subset-Logic Languages, Ph.D. dissertation. Department of Computer Science, SUNY-Buffalo, 1994.
    • (1994) Semantics of Subset-Logic Languages
    • Jana, D.1
  • 12
    • 0346440949 scopus 로고
    • Unpublished manuscript 1992, subsequently made available as TR 94-030, Department of Computer Science, SUNY-Buffalo
    • D. Jana, B. Jayaraman, Set Constructors, Finite Sets, and Logical Semantics, Unpublished manuscript 1992, subsequently made available as TR 94-030, Department of Computer Science, SUNY-Buffalo, 1994.
    • (1994) Set Constructors, Finite Sets, and Logical Semantics
    • Jana, D.1    Jayaraman, B.2
  • 14
    • 85034532398 scopus 로고    scopus 로고
    • Implementaton of subset-equational programming
    • B. Jayaraman, Implementaton of subset-equational programming, J. Logic Programming 12 (4) 299-324.
    • J. Logic Programming , vol.12 , Issue.4 , pp. 299-324
    • Jayaraman, B.1
  • 15
    • 12444264454 scopus 로고
    • Subset-logic programming: Application and implementation
    • Seattle
    • B. Jayaraman, A. Nair, Subset-logic programming: Application and implementation, Proceedings of the JICSLP, Seattle, 1988, pp. 841-858.
    • (1988) Proceedings of the JICSLP , pp. 841-858
    • Jayaraman, B.1    Nair, A.2
  • 18
    • 0002692684 scopus 로고
    • Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification
    • MIT Press, Cambridge, MA
    • J.-P. Jouannaud, C. Kirchner, Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification, in: Computational Logic: Essays in Honor of Alan Robinson, MIT Press, Cambridge, MA, 1991, pp. 257-321.
    • (1991) Computational Logic: Essays in Honor of Alan Robinson , pp. 257-321
    • Jouannaud, J.-P.1    Kirchner, C.2
  • 19
  • 20
    • 0025476212 scopus 로고
    • Logic programming with sets
    • G.M. Kuper, Logic programming with sets, J. Comput. System Sci. 41 (1) (1990) 44-64.
    • (1990) J. Comput. System Sci. , vol.41 , Issue.1 , pp. 44-64
    • Kuper, G.M.1
  • 24
    • 85035802526 scopus 로고
    • Unification in Boolean rings
    • Proceedings of the Eighth Conference on Automated Deduction. Springer
    • U. Martin, T. Nipkow, Unification in Boolean rings, in: Proceedings of the Eighth Conference on Automated Deduction. Leture Notes on Computer Science 230, Springer, 1986, pp. 506-513.
    • (1986) Leture Notes on Computer Science , vol.230 , pp. 506-513
    • Martin, U.1    Nipkow, T.2
  • 27
    • 84990727549 scopus 로고
    • Unification Theory
    • J. Siekmann, Unification Theory, J. Symbolic Comput. 7 (1) (1989) 207-274.
    • (1989) J. Symbolic Comput. , vol.7 , Issue.1 , pp. 207-274
    • Siekmann, J.1
  • 28
    • 9644309340 scopus 로고
    • An algorithm for general set unification and its complexity
    • F. Stolzenburg, An algorithm for general set unification and its complexity, J. Automat. Reason., . 1995.
    • (1995) J. Automat. Reason.
    • Stolzenburg, F.1


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