Givan, R., McAllester, D., Witty, C., Zalondek, K., Ontic: Language specification and user's manual, Tech. rep., MIT, 1992, Draft 4 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Set Theory for Verification: II - Induction and Recursion - Paulson (2000) (Correct)
....Thus, we have a generic treatment of recursion for generic theorem proving. In related work, Noel [18] has proved many theorems about recursion using Isabelle s set theory, including well founded recursion and a definition of lists. But Noel does not develop a general theory of recursion. Ontic [10] provides strong support for recursively defined functions and sets. Ontic s theory of recursion di#ers from mine; it treats recursive functions as least fixedpoints, with no use of wellfounded relations. The Knaster Tarski Theorem can be dropped. If h is continuous then n## h (#)isits least ....
Givan, R., McAllester, D., Witty, C., Zalondek, K., Ontic: Language specification and user's manual, Tech. rep., MIT, 1992, Draft 4
Set Theory for Verification: II - Induction and Recursion - Paulson (Correct)
....Thus, we have a generic treatment of recursion for generic theorem proving. In related work, Noel [18] has proved many theorems about recursion using Isabelle s set theory, including well founded recursion and a definition of lists. But Noel does not develop a general theory of recursion. Ontic [10] provides strong support for recursively defined functions and sets. Ontic s theory of recursion di#ers from mine; it treats recursive functions as least fixedpoints, with no use of wellfounded relations. The Knaster Tarski Theorem can be dropped. If h is continuous then # n## h n (#) is its ....
Givan, R., McAllester, D., Witty, C., Zalondek, K., Ontic: Language specification and user's manual, Tech. rep., MIT, 1992, Draft 4
Toward a Knowledge Medium for Collaborative Product.. - Gruber, Tenenbaum, Weber (1992) (13 citations) (Correct)
....notification of design changes, and active management of design dependencies. Much of the intellectual foundation has been laid, and we are drawing from representation work in design automation [34] decision support [1] design rationale [23] dependency management [27, 31] applied mathematics [13, 35], behavior modelling [6, 10, 30, 36] and the representation of everyday human experience [25] We plan to develop a basic ontological foundation and then extend it in the directions indicated by how it is used in practice by engineers. The initial shade ontology (based on [17] and an informal ....
Robert Givan, David McAllester, and Kevin Zalondek. Ontic91: Language specification and user's manual. Technical report, MIT, 1991.
Set Theory for Verification: I. From Foundations to Functions - Paulson (1998) (2 citations) (Correct)
....relations that hold within a formula. The axiomatic basis is apparently BG; some axioms are given explicitly, while others are built into the algorithms. Using its graphs, the program can perform intricate chains of reasoning. Ontic uses a Lisp like language for set theory expressions and proofs [16]. A fragment of this language is executable. Sets, classes, and recursive functions may be defined. The ZF axioms are built into a knowledge base of facts about set theory. Ontic appeals to definitions and theorems automatically; the user never refers to them by name. The aim is to let users ....
R. Givan, D. McAllester, C. Witty, and K. Zalondek. Ontic: Language specification and user's manual. Technical report, MIT, 1992. Draft 4.
Set Theory for Verification: II - Induction and Recursion - Paulson (1995) (Correct)
....Thus, we have a generic treatment of recursion for generic theorem proving. In related work, Noel [18] has proved many theorems about recursion using Isabelle s set theory, including well founded recursion and a definition of lists. But Noel does not develop a general theory of recursion. Ontic [10] provides strong support for recursively defined functions and sets. Ontic s theory of recursion differs from mine; it treats recursive functions as least fixedpoints, with no use of well founded relations. The Knaster Tarski Theorem can be dropped. If h is continuous then S n2 h n ( is its ....
Givan, R., McAllester, D., Witty, C., Zalondek, K., Ontic: Language specification and user's manual, Tech. rep., MIT, 1992, Draft 4
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC