检索结果-内蒙古大学图书馆

13th international conference on Hybrid Artificial Intelligent Systems (HAIS)

作者： Goncalves, Carlos Iglesias, E. L. Borrajo, L. Camacho, Rui Seara Vieira, A. Goncalves, Celia Talma Univ Vigo Higher Tech Sch Comp Engn Campus Univ Lagoas S-N Orense 32004 Spain FEUP U Porto Rua Dr Roberto Frias S-N P-4200465 Porto Portugal LIAAD INESC TEC Porto Portugal ISCAP P Porto Rua Jaime Lopes Amorim S-N P-4465004 Sao Mamede de Infesta Portugal U Porto LIACC Porto Portugal

ISBN: (纸本)9783319926391;9783319926384

Large corpus of scientific research papers have been available for a long time. However, most of those corpus store only the title and the abstract of the paper. For some domains this information may not be enough to achieve high performance in text mining tasks. this problem has been recently reduced by the growing availability of full text scientific research papers. A full text version provides more detailed information but, on the other hand, a large amount of data needs to be processed. A priori, it is difficult to know if the extra work of the full text analysis has a significant impact in the performance of text mining tasks, or if the effect depends on the scientific domain or the specific corpus under analysis. the goal of this paper is to show a framework for full text analysis, called LearnSec, which incorporates domain specific knowledge and information about the content of the document sections to improve the classification process with propositional and relational learning. To demonstrate the usefulness of the tool, we process a scientific corpus based on OSHUMED, generating an attribute/value dataset in Weka format and a First Order logic dataset in inductive logic programming (ILP) format. Results show a successful assessment of the framework.

关键词： Full text analyses Text preprocessing Text mining Use of background knowledge inductive logic programming

来源：评论

学校读者我要写书评

暂无评论

Branching-time temporal logic extended with qualitative presburger constraints

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Bozzelli, Laura Gascon, Regis CNRS LSV Cachan France ENS Cachan Cachan France

ISBN: (纸本)3540482814

Recently, LTL extended with atomic formulas built over a constraint language interpreting variables in Z has been shown to have a decidable satisfiability and model-checking problem. this language allows to compare the variables at different states of the model and include periodicity constraints, comparison constraints, and a restricted form of quantification. On the other hand, the CTL counterpart of this logic (and hence also its CTL* counterpart which subsumes both LTL and CTL) has an undecidable model-checking problem. In this paper, we substantially extend the decidability border, by considering a meaningful fragment of CTL* extended with such constraints (which subsumes both the universal and existential fragments, as well as the EF-like fragment) and show that satisfiability and model-checking over relational automata that are abstraction of counter machines are decidable. the correctness and the termination of our algorithm rely on a suitable well quasi-ordering defined over the set of variable valuations.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Design of Chinese Learning App for international Students based on User Satisfaction 6

Design of Chinese Learning App for International Students ba...

引用

6th international conference on Smart Grid and Electrical Automation (ICSGEA)

作者： Wang, Chao Dalian Polytech Univ Dalian 116034 Peoples R China

ISBN: (纸本)9781665432634

the existing Chinese learning app has the problem of imperfect logic programming model, which leads to the low compatibility of app. this paper designs a Chinese learning app for international students based on user satisfaction. According to the morpheme meaning classification of vocabulary attributes, using Chinese part of speech features to design vocabulary classification interface, based on user satisfaction to build a logical programming model, measure user information, combined with foreign students' Chinese learning mode to set offline learning function. Experimental results: the average compatibility of the designed app and the two existing apps is 76.830%, 61.593% and 59.168% respectively, which proves that the Chinese learning app integrated with user satisfaction has higher compatibility.

关键词： customer satisfaction Chinese learning software design offline learning

来源：评论

学校读者我要写书评

暂无评论

A local system for intuitionistic logic

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Tiu, Alwen Australian Natl Univ Canberra ACT Australia

ISBN: (纸本)3540482814

this paper presents systems for first-order intuitionistic logic and several of its extensions in which all the propositional rules are local, in the sense that, in applying the rules of the system, one needs only a fixed amount of information about the logical expressions involved. the main source of non-locality is the contraction rules. We show that the contraction rules can be restricted to the atomic ones, provided we employ deep-inference, i.e., to allow rules to apply anywhere inside logical expressions. We further show that the use of deep inference allows for modular extensions of intuitionistic logic to Dummett's intermediate logic LC, Godel logic and classical logic. We present the systems in the calculus of structures, a proof theoretic formalism which supports deep-inference. Cut elimination for these systems are proved indirectly by simulating the cut-free sequent systems, or the hypersequent systems in the cases of Dummett's LC and Godel logic, in the cut free systems in the calculus of structures.

关键词： proof theory intuitionistic logic intermediate logics deep inference calculus of structures locality

来源：评论

学校读者我要写书评

暂无评论

Algebraic Methodology and Software Technology - 13th international conference, AMAST 2010, Revised Selected Papers

Algebraic Methodology and Software Technology - 13th Interna...

引用

13th international conference on Algebraic Methodology and Software Technology, AMAST 2010

ISBN: (纸本)3642177956

the proceedings contain 15 papers. the topics discussed include: structural analysis for stochastic process algebra models;verification of common interprocedural compiler optimizations using visibly pushdown Kleene algebra;on the expressiveness of the π-calculus and the mobile ambients;integrating Maude into hets;model refinement using bisimulation quotients;coalgebraic semantics for parallel derivation strategies in logic programming;learning in a changing world, an algebraic modal logical approach;program calculation in coq;cooperation of algebraic constraint domains in higher-order functional and logic programming;a complete declarative debugger for Maude;and an assume guarantee approach for checking quantified array assertions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Goal-directed methods for Lukasiewicz logic

引用

18th international Workshop on Computer Science logic/13th Annual conference of the European-Association-for-Computer-Science-logic

作者： Metcalfe, G Olivetti, N Gabbay, D Kings Coll London Dept Comp Sci London WC2R 2LS England Univ Turin Dept Comp Sci I-10149 Turin Italy

ISBN: (纸本)3540230246

In this paper we present goal-directed deduction methods for Lukasiewicz infinite-valued logic L, giving logic programming style algorithms which both have a logical interpretation and provide a suitable basis for implementation. We begin by considering a basic version with connections to calculi for other logics, then make refinements to obtain greater efficiency and termination properties, and to deal with further connectives and truth constants. We finish by considering applications of these algorithms to fuzzy logic programming.

关键词： Lukasiewicz logics fuzzy logics coal-directed methods

来源：评论

学校读者我要写书评

暂无评论

CPP 2024 - Proceedings of the 13th ACM SIGPLAN international conference on Certified Programs and Proofs, Co-located with: POPL 2024

CPP 2024 - Proceedings of the 13th ACM SIGPLAN International...

引用

13th ACM SIGPLAN international conference on Certified Programs and Proofs, CPP 2024, in affiliation with the annual Symposium on Principles of programming, Languages, ,POPL 2024

ISBN: (纸本)9798400704888

the proceedings contain 20 papers. the topics discussed include: UTC time, formally verified;VCFloat2: floating-point error analysis in coq;the last yard: foundational end-to-end verification of high-speed cryptography;rooting for efficiency: mechanized reasoning about array-based trees in separation logic;compositional verification of concurrent C programs with search structure templates;unification for subformula linking under quantifiers;PfComp: a verified compiler for packet filtering leveraging binary decision diagrams;memory simulations, security and optimization in a verified compiler;lean formalization of extended regular expression matching with lookarounds;certification of confluence- and commutation-proofs via parallel critical pairs;a temporal differential dynamic logic formal embedding;and strictly monotone Brouwer trees for well-founded recursion over multiple arguments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cooperation of Algebraic Constraint Domains in Higher-Order Functional and logic programming

Cooperation of Algebraic Constraint Domains in Higher-Order ...

引用

13th international conference on Algebraic Methodology and Software Technology

作者： del Vado Virseda, Rafael Univ Complutense Madrid Dpto Sistemas Informat & Computac E-28040 Madrid Spain

ISBN: (纸本)9783642177958

this paper presents a theoretical framework for the integration of the cooperative constraint solving of several algebraic domains into higher-order functional and logic programming on A-abstractions, using an instance of a generic Constraint Functional logic programming (CFLP) scheme over a so-called higher-order coordination domain. We provide this framework as a powerful computational model for the higher-order cooperation of algebraic constraint domains over real numbers and integers, which has been useful in practical applications involving the hybrid combination of its components, so that more declarative and efficient solutions can be promoted. Our proposal of computational model has been proved sound and complete with respect to the declarative semantics provided by the CFLP scheme, and enriched with new mechanisms for modeling the intended cooperation among the algebraic domains and a novel higher-order constraint domain equipped with a sound and complete constraint solver for solving higher-order equations. We argue the applicability of our approach describing a prototype implementation on top of the constraint functional logic system TOY.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A comparison of reasoning techniques for querying large description logic ABoxes

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Motik, Boris Sattler, Ulrike Univ Manchester Manchester Lancs England

ISBN: (纸本)3540482814

Many modern applications of description logics (DLs) require answering queries over large data quantities, structured according to relatively simple ontologies. For such applications, we conjectured that reusing ideas of deductive databases might improve scalability of DL systems. Hence, in our previous work, we developed an algorithm for reducing a DL knowledge base to a disjunctive datalog program. To test our conjecture, we implemented our algorithm in a new DL reasoner KAON2, which we describe in this paper. Furthermore, we created a comprehensive test suite and used it to conduct a performance evaluation. Our results show that, on knowledge bases with large ABoxes but with simple TBoxes, our technique indeed shows good performance;in contrast, on knowledge bases with large and complex TBoxes, existing techniques still perform better. this allowed us to gain important insights into strengths and weaknesses of both approaches.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A new FMS simulator with object-oriented-programming techniques

引用

JOURNAL OF MATERIALS PROCESSING TECHNOLOGY 1998年第1-3期76卷 238-245页

作者： Li, XN Yuan, HB Huang, XY Cheung, EHM Nanjing Univ Sci & Technol Sch Mfg Engn Nanjing Peoples R China City Univ Hong Kong Dept Mfg Engn Kowloon Hong Kong

With the advance of research, design and operation of flexible manufacturing systems (FMS), new requirements have been presented for FMS simulators. these new requirements are high modelling efficiency, high model validity and credibility, more user-friendly features, real control and scheduling logic similar to a real FMS, and effective and correct analysis of results, etc. In this paper, a new FMS simulator (FMSSIM) based an object-oriented-programming (OOP) and some new techniques is introduced. the new techniques include: (i) fully interactive graphical modelling technique, with which the simulation modelling only needs 2-4 h to complete and thp model data are highly consistent and accurate;(ii) real FMS-like simulation control and scheduling, with which various control and scheduling algorithms such as Al-based heuristic scheduling can be easily implemented;(iii) the Intelligent Evaluator, with which the efficiency and accuracy of the evaluation process can be improved. Practical use has shown that the FMSSIM has a good performance in modelling, operation and evaluation. meeting the new requirements for a modern FMS simulator. (C) 1998 Elsevier Science S.A. All rights reserved.

关键词： flexible manufacturing system simulation simulator FMS simulation FMS modelling evaluation intelligent evaluation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：