作者: auxiliary 時(shí)間: 2025-3-21 21:01 作者: Exploit 時(shí)間: 2025-3-22 01:28
Semantics of non-monotonic reasoning based on perfect model,m. This new semantics of conditional programs shares a lot of common characteristics with logic programming and non-monotonic reasoning, such as priorities between predicates, minimizing extensions of predicates, and minimizing abnormality. A better understanding about the relationship between forms作者: Obituary 時(shí)間: 2025-3-22 05:38
Knowledge media station, and encourage incremental and interactive characteristics of constraint-based computation. The hypermedia part of Knowledge Media Station is knowledge-base with the function of so-called hypermedia. We will claim that, from the viewpoint of knowledge processing, hypermedia and logic programming can作者: N斯巴達(dá)人 時(shí)間: 2025-3-22 10:46
ildren durch ein spezifisches Enrichment sowohl in ihren fachlichen Begabungen als auch in ihren co-kognitiven Pers?nlichkeitsfaktoren so gef?rdert werden k?nnen, so dass sie unter besonders günstigen Bedingungen den Weg zurück ins Regelschulsystem finden k?nnen.作者: Solace 時(shí)間: 2025-3-22 13:45 作者: 郊外 時(shí)間: 2025-3-22 19:08 作者: Excitotoxin 時(shí)間: 2025-3-22 23:31 作者: Fillet,Filet 時(shí)間: 2025-3-23 03:53
Naoyoshi Tamura,Hiroaki Numazaki,Hozumi Tanakaieht sich haupts?chlich auf Kleinkriminalit?t, w?hrend sich die schweren Straftaten meistens in den offiziellen Berichten wiederfinden. Für relativ kleine übertretungen ist die Chance der Entdeckung geringer, falls der Verursacher nicht jemand mit schwarzer Hautfarbe ist, eine gute Schule besucht, a作者: 鋼筆記下懲罰 時(shí)間: 2025-3-23 06:33 作者: 獸群 時(shí)間: 2025-3-23 11:00 作者: expeditious 時(shí)間: 2025-3-23 15:07
0302-9743 presents the constraint logic programming language cu-Prolog, designed for combinatorial problems; the way cu-Prolog solves the constraints is based on program transformation.978-3-540-53919-3978-3-540-46398-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: NOT 時(shí)間: 2025-3-23 19:21
Semantics of non-monotonic reasoning based on perfect model,en understood very well. Recently, it has been proposed by C.Przymusinski that perfect model semantics for logic programming is also suitable for some special cases of non-monotonic formalisms. The importance of this result is not only for shedding new light on these two fields, but also for establi作者: Negotiate 時(shí)間: 2025-3-23 22:50
Time-bounded reasoning in first order knowledge base systems,system in the framework of the first order logic, we must overcome this problem..In this paper, we propose a time-bounded reasoning and investigate the properties of the knowledge base management system based on our time-bounded reasoning. We also show that the time-bounded reasoning is sound and va作者: 嗎啡 時(shí)間: 2025-3-24 06:24
Elementary formal system as a logic programming language,fiers of two atoms is finite and computable by restricting the form of axioms and goals without losing generality. The restriction makes the negation as failure rule complete. We give two conditions of EFS‘s such that the negation as failure rule is identical to the closed world assumption. We also 作者: 接合 時(shí)間: 2025-3-24 08:59 作者: 杠桿支點(diǎn) 時(shí)間: 2025-3-24 12:41
Parallel generalized LR parser based on logic programming,g table. Considering the compatibility of a breadth-first strategy with parallel processing, we developed a parallel generalized LR parser called PLR, whose algorithm is based on Tomita‘s algorithm. PLR is implemented in GIIC[Ueda 85] that is a concurrent logic programming language developed by the 作者: 易改變 時(shí)間: 2025-3-24 17:44
Knowledge media station,les users to incorporate and organize this knowledge together with various types of knowledge using a hypermedia framework. Knowledge Media Station consists of a Knowledge Processor, Inference Engine and Hypermedia. In the Inference Engine, we have developed a constraint logic programming language τ作者: 胰臟 時(shí)間: 2025-3-24 19:50
cu-Prolog and its application to a JPSG parser,ammar) as a suitable application..cu-Prolog employs . instead of the ordinary unification, and handles symbolic constraints in terms of user-defined predicates. The program clause of cu-Prolog is an expansion of Horn clause and is called .. The constraint satisfaction mechanism of cu-Prolog is based作者: flammable 時(shí)間: 2025-3-24 23:15
Table-driven Bottom Up Parser in Prolog,sition Grammars and idioms and so on..In this paper, we present another speed up method without spoiling these assets. The original BUP has no particular mechanism to choose one production rule deterministically; however, in our method the parser can restrain the nondeterminism by means of an action作者: avarice 時(shí)間: 2025-3-25 05:25
A consistency maintenance mechanism for subjective judgments and its application,re extracted and used to select alternatives effectively. The subjective judgments are quantified by using AHP based pairwise comparisons. In order to maintain consistency of the comparisons, we exploit the TMS based nonmonotonic inference in the Prolog-based production system KORE/IE. By using the 作者: coddle 時(shí)間: 2025-3-25 09:27
Logic design assistance using temporal logic based language Tokio,Therefore, Tokio can specify both concurrency and sequentiality accurately and easily. In this system, the behaviors at both the algorithmic level and the register transfer level are given in the same language: Tokio. This is one of the most outstanding characteristics. In this paper, we mainly pres作者: TRAWL 時(shí)間: 2025-3-25 15:38
icap beeintr?chtigt sind. Sowohl deren Diagnostik als auch ihre personale F?rderung wird als schwierig angesehen. Der Artikel zeigt anhand von Ausschnitten aus einer empirischen Unterrichtsentwicklungsforschung zun?chst in einer Kontextanalyse Rahmenbedingungen einer F?rderung von twice exceptionel 作者: 意外 時(shí)間: 2025-3-25 18:03
Donald Michieicap beeintr?chtigt sind. Sowohl deren Diagnostik als auch ihre personale F?rderung wird als schwierig angesehen. Der Artikel zeigt anhand von Ausschnitten aus einer empirischen Unterrichtsentwicklungsforschung zun?chst in einer Kontextanalyse Rahmenbedingungen einer F?rderung von twice exceptionel 作者: 容易生皺紋 時(shí)間: 2025-3-25 22:22
Y. Hosono,H. Kumagai,H. Shimizu,M. Sumida,A. Takeuchi,N. Takiguchi,T. Wake,T. Yamaokanenalter als kriminell betrachtet würde. Damit liegt hier eine juristische Definition vor, die sich nicht unmittelbar auf die seelische Gesundheit bezieht. Im Gegensatz zu landl?ufigen Meinungen richten sich etwa 90% der übertretungen gegen Eigentum und nicht gegen Personen: Stehlen, Autos verschieb作者: GRIEF 時(shí)間: 2025-3-26 03:43
Tsuda Hiroshi,Hasida K?iti,Sirai Hidetosives Verhalten, Ungezogenheit, Dominanzstreben). Kinderpsychiater benutzen den Begriff Hyperaktivit?t in eingegrenzter Form, indem sie Begriffe wie allgemeine motorische Unruhe und Unaufmerksamkeit (und manchmal mangelnde Impulskontrolle/erh?hte Impulsivit?t) damit verbinden. In der allgemeinen Bev?l作者: 珠寶 時(shí)間: 2025-3-26 04:22 作者: Mettle 時(shí)間: 2025-3-26 10:12 作者: 圍巾 時(shí)間: 2025-3-26 15:22
Nakamura Hiroshi,Nakai Masaya,Kono Shinji,Fujita Masahiro,Tanaka Hidehikostellen, da? eine Neurosenbehandlung ohne tiefenpsychologische Orientierung als unzeitgem?? betrachtet werden mu?. Die .schen Studien haben bekanntlich den entscheidenden Ansto? zu dieser Entwicklung gegeben. Doch ist diese noch nicht etwa so weit gediehen, da? man von einer einheitlichen Auffassung作者: ALOFT 時(shí)間: 2025-3-26 18:57
Conference proceedings 1991e covered. The first paper is an invited talk by Prof. Donald Michie, Chief Scientist of the Turing Institute, entitled "Human and Machine Learning of Descriptive Concepts", and introduces various research results on learning obtained by his group. There are eleven further papers, organized into sec作者: Intellectual 時(shí)間: 2025-3-26 22:37 作者: carbohydrate 時(shí)間: 2025-3-27 02:14 作者: Circumscribe 時(shí)間: 2025-3-27 05:17
Time-bounded reasoning in first order knowledge base systems,e properties of the knowledge base management system based on our time-bounded reasoning. We also show that the time-bounded reasoning is sound and valid. Furthermore, we discuss the selection of time functions and give three parameters of time functions. We also outline a prototype system we have realized in K-prolog on a Sun-3.作者: refine 時(shí)間: 2025-3-27 13:16
Elementary formal system as a logic programming language,as failure rule complete. We give two conditions of EFS‘s such that the negation as failure rule is identical to the closed world assumption. We also give a subclass of EFS‘s where a procedure of CWA is given as bounding the length of derivations We compare these classes with the Chomsky hierarchy.作者: EXALT 時(shí)間: 2025-3-27 14:01 作者: BALK 時(shí)間: 2025-3-27 21:20
Logic design assistance using temporal logic based language Tokio, the register transfer level are given in the same language: Tokio. This is one of the most outstanding characteristics. In this paper, we mainly present a data path verifier at the register transfer level. This verifier is a core part of the assistance system.作者: Gene408 時(shí)間: 2025-3-28 01:32 作者: 直言不諱 時(shí)間: 2025-3-28 04:38 作者: Expurgate 時(shí)間: 2025-3-28 08:30
Table-driven Bottom Up Parser in Prolog,ammars. The nondeterminism caused by the extension can be managed through the backtracking in the same way as the original BUP. We also present an implementation and experimental results from a practical-sized grammar with 560 production rules.作者: Confirm 時(shí)間: 2025-3-28 10:46 作者: 公式 時(shí)間: 2025-3-28 17:52 作者: Neuralgia 時(shí)間: 2025-3-28 19:04
https://doi.org/10.1007/3-540-53919-0Prolog; knowledge; learning; logic; machine learning; natural language processing; programming; programming作者: 子女 時(shí)間: 2025-3-28 23:11
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/587902.jpg作者: 最有利 時(shí)間: 2025-3-29 03:05
978-3-540-53919-3Springer-Verlag Berlin Heidelberg 1991作者: countenance 時(shí)間: 2025-3-29 10:01
Logic Programming ‘89978-3-540-46398-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: amygdala 時(shí)間: 2025-3-29 12:27
8樓作者: 藥物 時(shí)間: 2025-3-29 17:01
9樓作者: 易受騙 時(shí)間: 2025-3-29 21:53
9樓作者: labyrinth 時(shí)間: 2025-3-30 00:03
9樓作者: 美食家 時(shí)間: 2025-3-30 04:46
9樓作者: 鉗子 時(shí)間: 2025-3-30 09:45
10樓作者: 截?cái)?nbsp; 時(shí)間: 2025-3-30 16:26
10樓作者: Capitulate 時(shí)間: 2025-3-30 18:38
10樓作者: 奇怪 時(shí)間: 2025-3-30 23:53
10樓
