全文获取类型
收费全文 | 84篇 |
免费 | 5篇 |
国内免费 | 11篇 |
专业分类
电工技术 | 2篇 |
综合类 | 2篇 |
化学工业 | 1篇 |
金属工艺 | 1篇 |
机械仪表 | 12篇 |
石油天然气 | 2篇 |
无线电 | 3篇 |
一般工业技术 | 9篇 |
自动化技术 | 68篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 3篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2016年 | 2篇 |
2015年 | 2篇 |
2014年 | 3篇 |
2013年 | 6篇 |
2012年 | 5篇 |
2011年 | 3篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 3篇 |
2007年 | 6篇 |
2006年 | 6篇 |
2005年 | 4篇 |
2003年 | 5篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 7篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1985年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有100条查询结果,搜索用时 15 毫秒
71.
72.
Shie-Jue Lee 《Applied Intelligence》1995,5(4):297-317
Expert database systems were proposed to solve the difficulties encountered in traditional database systems. Prolog provides a fast prototyping tool for building such database systems. However, an intelligent database system implemented in Prolog faces a major restriction that only Horn rules are allowed in the knowledge base. We propose a theorem prover which can make inference for non-Horn intelligent database systems. Conclusions can be deduced from the facts and rules stored in a knowledge base. For a knowledge base with a finite domain, the prover can provide correct answers to queries, derive logical consequences of the database, and provide help in detecting inconsistencies or locating bugs in the database. The theorem prover is efficient in deriving conclusions from large knowledge bases which might swamp most of the other deductive systems. The theorem prover is also useful in solving heuristically the satisfiability problem related to a database with an infinite domain. A truth maintenance mechanism is provided to help eliminate repetitious work for the same goals.Supported by National Science Council under grant NSC 81-0408-E-110-9. 相似文献
73.
There has been a considerable amount of research into the provision of explicit representation of control regimes for resolution-based theorem provers. However, most of the existing systems are either not adequate or too inefficient to be of practical use. In this paper a theorem prover, ACT-P, which is adequate but retains satisfactory efficiency is presented. It does so by providing a number of user-changeable heuristics which are called at specific points during the search for a proof. The set of user-changeable heuristics was determined on the basis of a classification of the heuristics used by existing resolution-based theorem provers. 相似文献
74.
Wim H. Hesselink 《Formal Aspects of Computing》1997,9(2):208-226
We describe the construction of a distributed algorithm with asynchronous communication together with a mechanically verified proof of correctness. For this purpose we treat Segall's PIF algorithm (propagation of information with feedback). The proofs are based on invariants, and variant functions for termination. The theorem prover NQTHM is used to deal with the many case distinctions due to asynchronous distributed computation. Emphasis is on the modelling assumptions, the treatment of nondeterminacy, the forms of termination detection, and the proof obligations for a complete mechanical proof. Finally, a comparison is made with (the proof of) the minimum spanning tree algorithm of Gallager, Humblet, and Spira, for which the technique was developed. 相似文献
75.
Yuan Yu 《Journal of Automated Reasoning》1990,6(3):251-286
This paper reports the results of an experiment in using the Boyer-Moore Theorem Prover in seeking computer-checked proofs in Group Theory. Starting from the axioms for groups and elementary list and number theory, the theorem prover was led to the proofs of two basic theorems in Elementary Group Theory by a sequence of lemmas suggested by the author. The computer proofs illustrate the effective use of the Boyer-Moore Theorem Prover in Group Theory. 相似文献
76.
David M. Russinoff 《Journal of Automated Reasoning》1985,1(2):121-139
This paper describes the use of the Boyer-Moore theorem prover in mechanically generating a proof of Wilson's theorem: for any prime p, (p-1)! and p-1 are congruent modulo p. The input to the theorem prover consists of a sequence of three function definitions and forty-two propositions to be proved. The proofs generated by the system are based on a library of lemmas relating to list manipulation and number theory, including Fermat's theorem. 相似文献
77.
Real-time systems usually involve a subtle interaction of a number of distributed components and have a high degree of parallelism,
which makes their performance analysis quite complex. Thus, traditional techniques, such as simulation, or the state-based
formal methods usually fail to produce reasonable results. In this paper, we propose to use higher-order-logic (HOL) theorem
proving for the performance analysis of real-time systems. The idea is to formalize the real-time system as a logical conjunction
of HOL predicates, whereas each one of these predicates define an autonomous component or process of the given real-time system.
The random or unpredictable behavior found in these components is modeled as random variables. This formal specification can
then be used in a HOL theorem prover to reason about both functional and performance related properties of the given real-time
system. In order to illustrate the practical effectiveness of our approach, we present the analysis of the Stop-and-Wait protocol,
which is a classical example of real-time systems. The functional correctness of the protocol is verified by proving that
the protocol ensures reliable data transfers. Whereas, the average message delay relation is verified in HOL for the sake
of performance analysis. The paper includes the protocol’s formalization details along with the HOL proof sketches for the
major theorems. 相似文献
78.
79.
This paper presents a family of theorem provers for classical, intuitionistic and neighbouring logics. The theorem provers are based on a formulation of these logics in terms of conjunction, implication and falsity. Computation is goal directed, and, for the special case of Horn clauses, coincides with pure Prolog computation. Our approach is generic, and, as we shall show in a subsequent paper, can be adapted to other logics, such as modal and temporal systems.The research described in this paper has been funded partially by Esprit project No. 393, ACORD, of the European Commission. 相似文献
80.
David M. Russinoff 《Journal of Automated Reasoning》1992,8(1):3-21
We describe the use of the Boyer-Moore theorem prover in mechanically generating a proof of the Law of Quadratic Reciprocity: for distinct odd primes p and q, the congruences x
2
q (mod p) and x
2
p (mod q) are either both solvable or both unsolvable, unless pq3 (mod 4). The proof is a formalization of an argument due to Eisenstein, based on a lemma of Gauss. The input to the theorem prover consists of nine function definitions, thirty conjectures, and various hints for proving them. The proofs are derived from a library of lemmas that includes Fermat's Theorem and the Gauss Lemma. 相似文献