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

丛书名： Lecture Notes in Computer Science

1000年

作者： Jaume Bacardit Ester Bernadó-Mansilla Martin V. Butz Tim Kovacs Xavier Llorà Keiki Takadama

ISBN: (数字)9783540881384

ISBN: (纸本)9783540881377

This book constitutes the thoroughly refereed joint post-conference proceedings of two consecutive international workshops on Learning Classifier Systems that took place in Seattle, WA, USA in July 2006, and in London, UK, in July 2007 - all hosted by the Genetic and Evolutionary Computation Conference, GECCO. The 14 revised full papers presented were carefully reviewed and selected from the workshop contributions. The papers are organized in topical sections on knowledge representation, analysis of the system, mechanisms, new directions, as well as applications.

关键词： Artificial Intelligence programming Techniques programming Languages, Compilers, Interpreters Mathematical logic and Formal Languages Data Mining and knowledge Discovery Models and Principles

来源：评论

学校读者我要写书评

暂无评论

The Information Agent: an infrastructure agent supporting collaborative enterprise architectures

The Information Agent: an infrastructure agent supporting co...

引用

IEEE international workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE)

作者： M. Barbuceanu M.S. Fox Enterprise Integration Laboratory Department of Industrial Engineering University of Toronto Canada

We introduce the Information Agent as a component of the information infrastructure supporting collaborative computing environments. We discuss the functions of the Information Agent, describe an architecture based on an agent program and a knowledge management system and present out choices for these components. We show how the architecture can be designed and implemented using description logic representation systems and argue for the advantages of this approach. Then we show how services supporting time-map management, conflict resolution, deductive queries and change management have been introduced and how all of these support the functions of the Information Agent.< >

关键词： Collaboration knowledge management Intelligent agent Computer architecture Environmental management Protocols Industrial engineering logic design Information management knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Does Content Effect in LLMs Point to Genuine Reasoning? 3

Does Content Effect in LLMs Point to Genuine Reasoning?

引用

3rd workshop on Bias, Risk, Ethical AI, Explainability and the Role of logic and logic programming, BEWARE 2024

作者： Natarajan, Karthik Prasanna Human Sciences Research Center International Institute of Information Technology Telangana Hyderabad500032 India

Training and evaluating LLMs on deductive reasoning tasks has attracted much attention in recent times. Some studies have shown interesting results which suggest that LLMs behave like humans in displaying content effect, that is, they reason better on reasoning tasks containing rules that align with our everyday beliefs and reason poorly when the rules are belief-violating. On the other hand, there are studies which challenge whether LLMs genuinely reason and attribute their reasoning to artifacts from the training data. In order to make sense of claims concerning genuine reasoning, we introduce a framework developed by Diane Proudfoot's externalist criteria for machine cognition, which is based on Wittgenstein's argument that deductive reasoning involves rule-following which is normative in nature. We propose the use of Proudfoot's criteria for rule-following as a framework to distinguish genuine deductive competence from quasi deductive competence. In doing so, we also draw attention to the limitations and implications of Proudfoot's claims regarding machine cognition through the introduction of a thought experiment. This thought experiment enables us to think through Proudfoot's argument, according to which it is due to pragmatic considerations-and not in principle-that LLMs are unlikely to possess genuine reasoning. © 2024 Copyright for this paper by its authors.

关键词： content effect deductive reasoning large language models rule-following Wittgenstein

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal = Spatial × Temporal 3

Spatiotemporal = Spatial × Temporal

引用

3rd Joint Ontology workshops, Episode VIII: The Svear Sommar of Ontology, JOWO 2022

作者： Bai, Yunpiao Grüninger, Michael Department of Mechanical and Industrial Engineering University of Toronto TorontoON Canada

There has been a constant debate about how to integrate spatial and temporal representation together. Three-dimensionalists believe that objects only have spatial dimensions;thus, they take space and time as two separate domains, so-called "three-plus-one"dimensional approach. Controversially, four dimensionalists argue that objects extend on time just as they extend on space, in which space and time is one primitive domain. In this research, we attempt to harmonize both of these views and interlink the two;meanwhile we justify our choices through a set of motivating scenarios. We also present our axiomatization of spatiotemporal regions and their mereotopology using the product order of spatial and temporal mereotopologies. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 international (CC BY 4.0).

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

3rd international Conference on Ecosystem Assessment Management, ICEAM 2013 and the workshop on the Construction of an Early Warning Platform for Eco-Tourism, WCEWPET 2013

3rd International Conference on Ecosystem Assessment Managem...

引用

3rd international Conference on Ecosystem Assessment Management and the workshop on the Construction of an Early Warning Platform for Eco-Tourism, 2013

ISBN: (纸本)9783319034485

The proceedings contain 51 papers. The special focus in this conference is on Application of Operations Research and Fuzzy Systems. The topics include: Geomatics in ecosystem assessment and management;framework of an ecotourism early warning system;analysis of economic spatial structure evolvement and characteristic in Qinghai province;emergy footprint analysis of gannan Tibet an autonomous prefecture ecological economic systems;the analysis of water resource ecological carrying capacity of Hainan international island;research on Hainan ecotourism system early warning;the method of tourism environmental carrying capacity;study on evaluation method of eco-tourism city to Hainan island;an analytical study on tourism informatization in Hainan international tourism island;land use and land cover mapping using fuzzy logic;a new measurement of similarity about rough vague set;agricultural product traceability with services resource provisioning;raster-based parallel multiplicatively weighted voronoi diagrams algorithm with mapreduce;qualitative evaluation of software reliability considering many uncertain factors;quantum-behaved particle swarm optimization with diversity-maintained;research of travel route programming on Hainan island;path optimization method of logistics distribution based on mixed multi-intelligence algorithms;Hainan virtual tourism GIS based on speech interface;research of 3D virtual scene generation and visualization based on images;geopolitical dimensions of a global phenomenon;social network analysis as a tool in sampling and dissemination strategies and economic valuation of terrestrial ecosystem services.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The π-calculus as a theory in linear logic: Preliminary results 3rd

引用

3rd international workshop on Extensions of logic programming, ELP 1992

作者： Miller, Dale Computer Science Department University of Pennsylvania PhiladelphiaPA19104-6389 United States

ISBN: (纸本)9783540564546

The agent expressions of the π-calculus can be translated into a theory of linear logic in such a way that the reflective and transitive closure of π-calculus (unlabeled) reduction is identified with "entailedby". Under this translation, parallel composition is mapped to the multiplicative disjunct ("par") and restriction is mapped to universal quantification. Prefixing, non-deterministic choice (+), replication (!), and the match guard are all represented using non-logical constants, which are specified using a simple form of axiom, called here a process clause. These process clauses resemble Horn clauses except that they may have multiple conclusions;that is, their heads may be the par of atomic formulas. Such multiple conclusion clauses are used to axiomatize communications among agents. Given this translation, it is nature to ask to what extent proof theory can be used to understand the meta-theory of the π-calculus. We present some preliminary results along this line for π0, the "propositional" fragment of the π-calculus, which lacks restriction and value passing (π0 is a subset of CCS). Using ideas from proof-theory, we introduce co-agents and show that they can specify some testing equivalences for π0. If negation-as-failure-to-prove is permitted as a co-agent combinator, then testing equivalence based on co-agents yields observational equivalence for π0. This latter result follows from observing that co-agents directly represent formulas in the Hennessy-Milner modal logic. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

AI approach to formal analysis of BPMN models: Towards a logical model for BPMN diagrams

Advances in Intelligent Systems and Computing

引用

Advances in Intelligent Systems and Computing 2014年 257卷 69-88页

作者： Ligęza, Antoni Potempa, Tomasz AGH University of Science and Technology al. A. Mickiewicza 30 Krakow30-059 Poland Higher School of Tarnow ul Mickiewicza 8 Tarnow33-100 Poland

ISBN: (纸本)9783319036762

Modeling Business Processes has become a challenging issue of today’s knowledge Management. As such it is a core activity of knowledge Engineering. There are two principal approaches to modeling such processes, namely Business Process Modeling and Notation (BPMN) and Business Rules (BR). Both these approaches are to certain degree complementary, but BPMN seems to become a standard supported by OMG. In this paper we investigate how to build a logical model of BPMN using logic, logic programming and rules. The main focus in on logical reconstruction of BPMN semantics which is necessary to define some formal requirements on model correctness enabling formal verification of such models. © Springer international Publishing Switzerland 2014.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

E-Friend: A logical-Based AI Agent System Chat-Bot for Emotional Well-Being and Mental Health 1st

E-Friend: A Logical-Based AI Agent System Chat-Bot for Emoti...

引用

1st international workshop on Deceptive AI, DeceptECAI 2020, held in conjunction with 24th European Conference on Artificial Intelligence, ECAI 2020 and 2nd international workshop on Deceptive AI, DeceptAI 2021, held in conjunction with 30th international Joint Conference on Artificial Intelligence, IJCAI 2021

作者： Galindo, Mauricio J. Osorio Moreno, Luis A. Montiel Rojas-Velázquez, David Nieves, Juan Carlos Universidad de las Américas Puebla Ex Hacienda Sta. Catarina Mártir S/N. San Andrés Cholula Puebla72810 Mexico San Andrés Cholula Mexico Department of Computing Science Umeå University Umeå Sweden

ISBN: (纸本)9783030917784

In this work, it is proposed the design of a Reasoning logical Based Intelligent Agent System Chat-bot for Dialogue Composition (DC) named E-friend, which uses logic programming (LP) for reasoning tasks. The main contribution is the use of knowledge representation Reasoning with LP theories modelling the knowledge of the user agent (beliefs, intentions, and expectations) to reason, plan and to optimally solve the DC problem. Another contribution is the design of a system component that extends the theory of mind, for the user model, with emotions to detect if the user decepts to the system or to itself. This component has the aim to alert and inform the facilitator when E-friend detects possible deceit signals from the student. E-friend was designed to help first year university students to manage stress/anxiety to optimal well-being development and attempt the prevention of depression and addictions leading. Students can interact through a chat-bot (text-based questions and answers) to help the system learns from the user, at the same time the user learns from itself improving mental health well-being. © 2021, Springer Nature Switzerland AG.

关键词： knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Tutorial on termination of logic programs 3rd

引用

3rd international workshop on Meta-programming in logic, META 1992

作者： De Schreye, Danny Verschaetse, Kristof Department of Computer Science Katholieke Universiteit Lenven Celestijnenlaan 200A Heverlee3001 Belgium

ISBN: (纸本)9783540562825

We present a general introduction to termination analysis for logic programs, with focus on universal termination of SLD-derivations and on definite programs. We start by providing a generic definition of the termination problem. It is parametrised by the sets of goals and the sets of computation rules under consideration. We point out a distinction between two streams of work, each taking a different approach with respect to the undecidability of the halting problem. We then recall the notions of recurrency and acceptability from the works of Apt, Bezem and Pedreschi. We illustrate how these notions provide an elegant framework for reasoning about termination. We then identify four basic components that are present in any approach to termination analysis. We point out the interdependencies between these components and their relevance for the termination analysis as a whole. We also use these components to illustrate some differences between automatic approaches to termination analysis and the more theoretically oriented frameworks for termination. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Ada-concurrency specified by graph grammars 3rd

引用

3rd international workshop on Graph-Grammars and Their Application to Computer Science, 1986

作者： Jackel, Manfred EWH-Rheinland-Pfalz Seminar für Informatik Rheinau 3–4 KoblenzD-5400 Germany

ISBN: (纸本)9783540187714

This paper demonstrates a notion for formal semantics specification of concurrent programming languages and applies it to the concurrent part of the programming language Ada. The abstract syntax of an Ada program is given by a graph representation called the program graph. This program graph is the input for an abstract interpreter consisting of a set of graph rewriting rules. Therefore, this interpreter is a graph rewriting system, i. e. a graph grammar. A derivation step in this graph grammar allows the parallel application of a finite set of sequential rewriting rules, thus modelling the independent progress of parallel tasks. It is shown that the notion successfully copes with Ada concurrency, including dynamic creation of tasks, task hierarchies, synchronization, and timing considerations. The abstract implementation by an interpreter gives rise to some considerations concerning the precision of the informal, official Ada Standard and the adequacy of some language features, especially with respect to the interaction of exception handling and concurrency. This paper gives an extended abstract of the main ideas of [SPEC]. © 1987, Springer-Verlag.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：