منابع مشابه
Interval Computation as Deduction in CHIP
Logic programming realizes the ideal of \computation is deduction," but not when oating-point numbers are involved. In that respect logic programming languages are as careless as conventional computation: they ignore the fact that oating-point operations are only approximate and that it is not easy to tell how good the approximation is. It is our aim to extend the beneets of logic programming t...
متن کاملComputation and Deduction
ion and function application employ the notion of substitution. Recall the inference rule and its representation in LF: e1 ↪→ lam x. e1 e2 ↪→ v2 [v2/x]e1 ↪→ v ev app e1 e2 ↪→ v ev app : ΠE1:exp. ΠE2:exp. ΠE′ 1:exp→ exp. ΠV2:exp. ΠV :exp. eval E1 (lam E′ 1) → eval E2 V2 → eval (E′ 1 V2) V → eval (app E1 E2) V. As before, we transcribe this (and the trivial rule for evaluating λ-expressions) into...
متن کاملSyntactic Computation as Labelled Deduction : WH a case study
1) The Question Over the past thirty years, the phenomenon of long-distance dependence has become one of the most well studied phenomena. Requiring as it does correlation between some position in a string and the c-commanding operator which determines its interpretation, it is uncontroversially assumed across different theoretical frameworks to involve an operator-variable binding phenomenon as...
متن کاملIntegration of Deduction and Computation
We outline some of our approaches to the integration of Computer Algebra Systems and Automated Theorem Provers. Experimental couplings led to the development of the OMSCS framework, an architecture to specify the coupling of computational and reasoning systems. A model deening the context of a computation is proposed next. Finally, a multi-agent approach, built upon our KOMET project, is then o...
متن کاملParallelizing the Closure Computation in Automated Deduction
In this paper we present a parallel algorithm for computing the closure of a set under an operation. This particular type of computation appears in a variety of disguises, and has been used in automated theorem proving, abstract algebra, and formal logic. The algorithm we give here is particularly suited for shared-memory parallel computers, where it makes possible economies of space. Implement...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1993
ISSN: 0743-1066
DOI: 10.1016/0743-1066(93)90045-i