作者: Malleable 時(shí)間: 2025-3-21 21:07 作者: ADORE 時(shí)間: 2025-3-22 03:25
On Asking What a Database Knows,nces about what the database knows, not, as is usually the case, as first order sentences about the external world. On this view, integrity constraints are modal sentences and hence are formally identical to a strict subset of the permissible database queries. Integrity maintenance then becomes form作者: novelty 時(shí)間: 2025-3-22 04:52 作者: 同位素 時(shí)間: 2025-3-22 12:35 作者: 和藹 時(shí)間: 2025-3-22 13:59
on of the future. Secondly, this volume is the first of an ESPRIT Basic Research Series of publications of research results. It is expected that the quality of content and broad distribution of this series will have a major impact in making the advances achieved accessible to the world of academic and industr978-3-642-76276-5978-3-642-76274-1作者: 和藹 時(shí)間: 2025-3-22 21:02 作者: 只有 時(shí)間: 2025-3-22 23:47
https://doi.org/10.1007/978-3-663-05106-0gic. The interface between these two different modes of reasoning is accomplished by a new rule of inference, called .. Correctness, completeness as well as the decidability of the constraints (in a restricted constraint language) are shown.作者: Infraction 時(shí)間: 2025-3-23 04:00 作者: Phonophobia 時(shí)間: 2025-3-23 07:39
https://doi.org/10.1007/978-3-642-99711-2function of the models of the argument theories. Some examples from default reasoning, knowledge assimilation, inheritance networks and hypothetical reasoning are presented to demonstrate the expressive power of the operators.作者: Awning 時(shí)間: 2025-3-23 11:45
Studie über Minderwertigkeit von Organenrun in other modes. To make the technique work it is necessary to synthesise pure logic programs, without the closed world assumption, and then compile these into Prolog programs. The technique has been tested on the OYSTER (functional) program development system.作者: foodstuff 時(shí)間: 2025-3-23 14:10 作者: parallelism 時(shí)間: 2025-3-23 22:02
Composition Operators for Logic Theories,function of the models of the argument theories. Some examples from default reasoning, knowledge assimilation, inheritance networks and hypothetical reasoning are presented to demonstrate the expressive power of the operators.作者: cocoon 時(shí)間: 2025-3-24 00:01
The Synthesis of Logic Programs from Inductive Proofs,run in other modes. To make the technique work it is necessary to synthesise pure logic programs, without the closed world assumption, and then compile these into Prolog programs. The technique has been tested on the OYSTER (functional) program development system.作者: esculent 時(shí)間: 2025-3-24 04:19
Programming in 2010? A scientific and industrial challenge,his enormous discrepancy of acceptance between the hardware and the software domain. Is it a lack of flexibility on the user side, or a lack of insight in the importance of software by the manufacturers, or is it just a matter of complexity? Is a new piece of software really that much more complex than a new hardware component?作者: 消音器 時(shí)間: 2025-3-24 10:10 作者: Awning 時(shí)間: 2025-3-24 13:09
https://doi.org/10.1007/978-3-663-04314-0t also the development of logic-based management tools. I shall argue that, for these purposes, two major extensions of logic programming are needed — abduction and metalevel reasoning. I shall also argue that extensions of full first-order logic may not be necessary.作者: AVID 時(shí)間: 2025-3-24 15:03
https://doi.org/10.1007/978-3-663-04314-0new language and illustrate its capabilities by means of varied examples. We also present the theoretical foundations of Prolog III, which in fact apply to a whole family of programming languages. The central innovation is to replace the concept of unification by the concept of constraint solving.作者: 小步走路 時(shí)間: 2025-3-24 22:17
https://doi.org/10.1007/978-3-322-88452-7rily from the console, using a screen attached to the computer and projected by an overhead projector. The students were expected to do their homework on a computer, and the final examination was a project on a topic selected individually by each student, again, to be done on the computer.作者: 調(diào)整校對(duì) 時(shí)間: 2025-3-25 00:59 作者: 強(qiáng)壯 時(shí)間: 2025-3-25 07:24 作者: Salivary-Gland 時(shí)間: 2025-3-25 09:37 作者: 小木槌 時(shí)間: 2025-3-25 13:58
Exploration with ,rily from the console, using a screen attached to the computer and projected by an overhead projector. The students were expected to do their homework on a computer, and the final examination was a project on a topic selected individually by each student, again, to be done on the computer.作者: Optometrist 時(shí)間: 2025-3-25 18:21 作者: 潛移默化 時(shí)間: 2025-3-25 20:44
https://doi.org/10.1007/978-3-322-88452-7specification or verification has been studied. Thus a program for computing a mathematical function generally has trivial interaction, whereas interaction with the outside world is the essence of a program for controlling the landings of airplanes.作者: 四指套 時(shí)間: 2025-3-26 03:26 作者: 獨(dú)行者 時(shí)間: 2025-3-26 06:46 作者: Glutinous 時(shí)間: 2025-3-26 10:17
https://doi.org/10.1007/978-3-663-04314-0tegrates refined processing of trees and lists, number processing, and processing of two-valued Boolean algebra. We present the specification of this new language and illustrate its capabilities by means of varied examples. We also present the theoretical foundations of Prolog III, which in fact app作者: Allure 時(shí)間: 2025-3-26 13:27
https://doi.org/10.1007/978-3-663-19722-5sion for a default theory, which handles parameters as genuine object variables. The new form of default logic may be preferable when the domain closure assumption is not postulated. It stands in a particularly simple relation to circumscription. Like circumscription, it can be viewed as a syntactic作者: gratify 時(shí)間: 2025-3-26 20:09
Schiffsbeprobung 2: Probenahme von Chromerz, they can be said to be claims about the truths of some external world; the database is a representation of that world..Virtually all approaches to database query evaluation treat queries as first order formulas, usually with free variables whose bindings resulting from the evaluation phase define t作者: 散步 時(shí)間: 2025-3-26 23:18
https://doi.org/10.1007/978-3-322-88452-7specification or verification has been studied. Thus a program for computing a mathematical function generally has trivial interaction, whereas interaction with the outside world is the essence of a program for controlling the landings of airplanes.作者: 潰爛 時(shí)間: 2025-3-27 04:21
https://doi.org/10.1007/978-3-322-88452-7al lines. I used a Macintosh II computer and the . symbolic computation program, a product of Wolfram Research, Inc. The lectures were delivered primarily from the console, using a screen attached to the computer and projected by an overhead projector. The students were expected to do their homework作者: Erythropoietin 時(shí)間: 2025-3-27 07:57 作者: 是剝皮 時(shí)間: 2025-3-27 11:40 作者: BROW 時(shí)間: 2025-3-27 16:31 作者: 指派 時(shí)間: 2025-3-27 21:36
https://doi.org/10.1007/978-3-663-05106-0purpose is to represent the generic concepts and the taxonomical hierarchies of the domain to be modeled. This paper addresses the combination of the fast taxonomical reasoning algorithms (e.g. subsumption, the classifier etc.) that come with these languages and reasoning in first order predicate lo作者: 招致 時(shí)間: 2025-3-27 23:04
Einleitung und Aufgabenstellung, houses and computer vendors are still very poor if compared to the state-of-the-art in advanced research. Fortran and Cobol are still among the most widely used programming languages, relational databases are just starting to penetrate the market. The breathtaking speed of transfer of new hardware 作者: HARD 時(shí)間: 2025-3-28 02:59
Einleitung und Aufgabenstellung, users and of fewer “programmers” by 2010. Computational Logic will have to fit in a wider context. For applications programming, and to some extent system programming, the context is likely to be the following: applications will mainly become cooperative and distributed, and distribution will be tr作者: 感情脆弱 時(shí)間: 2025-3-28 06:52
https://doi.org/10.1007/978-3-322-86297-6il furnished with computer checked proofs that they met there specifications. I was careful to point out that the buyer would have to be careful that the specification reflected his real requirements. Alas, almost 30 years later computer checked proofs are still not in practical use.作者: aspect 時(shí)間: 2025-3-28 12:00
ESPRIT Basic Research Serieshttp://image.papertrans.cn/c/image/232618.jpg作者: Triglyceride 時(shí)間: 2025-3-28 16:02 作者: 樂(lè)意 時(shí)間: 2025-3-28 20:01 作者: arbovirus 時(shí)間: 2025-3-29 02:35 作者: esculent 時(shí)間: 2025-3-29 06:47 作者: 現(xiàn)代 時(shí)間: 2025-3-29 08:06 作者: Spartan 時(shí)間: 2025-3-29 12:53 作者: 暗指 時(shí)間: 2025-3-29 19:16 作者: 咯咯笑 時(shí)間: 2025-3-29 21:35
978-3-642-76276-5ECSC — EEC — EAEC, Brussels — Luxembourg 1990作者: APNEA 時(shí)間: 2025-3-30 01:38
Problems and Promises of Computational Logic,velopment of a single logic for representing programs, program specifications, databases, and knowledge representations in artificial intelligence, but also the development of logic-based management tools. I shall argue that, for these purposes, two major extensions of logic programming are needed —作者: CUR 時(shí)間: 2025-3-30 04:10
An Introduction to Prolog III,tegrates refined processing of trees and lists, number processing, and processing of two-valued Boolean algebra. We present the specification of this new language and illustrate its capabilities by means of varied examples. We also present the theoretical foundations of Prolog III, which in fact app作者: 低三下四之人 時(shí)間: 2025-3-30 09:19 作者: 紀(jì)念 時(shí)間: 2025-3-30 12:50 作者: 轉(zhuǎn)換 時(shí)間: 2025-3-30 19:25
Two Kinds of Program Specifications,specification or verification has been studied. Thus a program for computing a mathematical function generally has trivial interaction, whereas interaction with the outside world is the essence of a program for controlling the landings of airplanes.作者: cunning 時(shí)間: 2025-3-30 22:44 作者: 宿醉 時(shí)間: 2025-3-31 01:24
Composition Operators for Logic Theories,Both a transformational and an interpretive characterization of the operators are provided and proved equivalent. The former definition says how to syntactically construct a new theory out of two given theories, the latter provides a meta-level interpretation of the same operators. A declarative — b作者: Ablation 時(shí)間: 2025-3-31 08:51
The Synthesis of Logic Programs from Inductive Proofs,ng functional programs as total functions. Logic programs, on the other hand, define predicates. They can be run in different input modes, they sometimes produce multiple outputs and sometimes none. They may not terminate. The key idea of the adaptation is that a predicate is a total function in the作者: homocysteine 時(shí)間: 2025-3-31 12:23 作者: AFFIX 時(shí)間: 2025-3-31 14:45
Concept Logics,purpose is to represent the generic concepts and the taxonomical hierarchies of the domain to be modeled. This paper addresses the combination of the fast taxonomical reasoning algorithms (e.g. subsumption, the classifier etc.) that come with these languages and reasoning in first order predicate lo作者: 小溪 時(shí)間: 2025-3-31 21:35
Programming in 2010? A scientific and industrial challenge, houses and computer vendors are still very poor if compared to the state-of-the-art in advanced research. Fortran and Cobol are still among the most widely used programming languages, relational databases are just starting to penetrate the market. The breathtaking speed of transfer of new hardware
