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

14th international conference on the Principles of Knowledge Representation and reasoning

作者： Oveisi, Mehrdad Delgrande, James P. Pelletier, Francis Jeffry Popowich, Fred Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Univ Alberta Dept Philosophy Edmonton AB T6G 2E7 Canada

A strong intuition for AGM belief change operations, Gardenfors suggests, is that formulas that are independent of a change should remain intact. Based on this intuition, Farias and Herzig axiomatize a dependence relation w.r.t. a belief set, and formalize the connection between dependence and belief change. In this paper, we introduce base dependence as a relation between formulas w.r.t. a belief base. After an axiomatization of base dependence, we formalize the connection between base dependence and a particular belief base change operation, saturated kernel contraction. Moreover, we prove that base dependence is a reversible generalization of Farias and Herzig's dependence. that is, in the special case when the underlying belief base is deductively closed (i.e., it is a belief set), base dependence reduces to dependence. Finally, an intriguing feature of Farias and Herzig's formalism is that it meets other criteria for dependence, namely, Keynes' conjunction criterion for dependence (CCD) and Gardenfors' conjunction criterion for independence (CCI). We show that our base dependence formalism also meets these criteria. More interestingly, we offer a more specific criterion that implies both CCD and CCI, and show our base dependence formalism also meets this new criterion.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enriched modeling and reasoning on business processes with ontologies and answer set programming 16th

Enriched modeling and reasoning on business processes with o...

引用

16th international conference on Business Process Management Forum, BPM Forum 2018

作者： Giordano, Laura theseider Dupré, Daniele DISIT Università del Piemonte Orientale Alessandria Italy

ISBN: (纸本)9783319986500

Domain ontologies may provide the proper level of abstraction in modeling semantic constraints and business rules in BPM;in fact, ontologies are intended to define terminologies to be shared within and across organizations and reused in different applications. In this paper we show how Answer Set programming (ASP), a powerful framework for declarative problem solving, can accommodate for domain ontologies in modeling and reasoning about Business Processes, especially for process verification. Description logics (DLs) provide the formal counterpart of ontologies, and in our approach knowledge on the process domain is expressed in a low-complexity DL. Terms from the ontology can be used in embedding business rules in the model as well as in expressing constraints that should be verified to achieve compliance by design. Causal rules for reasoning on side-effects of activities in the process domain can be derived, based on knowledge expressed in the DL. We show how ASP can accommodate them, relying on a reasoning about actions and change approach, for process analysis, and, in particular, for verifying formulas in temporal logic. © Springer Nature Switzerland AG 2018.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

international Joint 7th Ibero-American conference on Artificial Intelligence, IBERAMIA 2000 and 15th Brazilian symposium on Artificial Intelligence, SBIA 2000

International Joint 7th Ibero-American Conference on Artific...

引用

international Joint conference - 7th Ibero-American conference on Artificial Intelligence, IBERAMIA 2000 and 15th Brazilian symposium on Artificial Intelligence, SBIA 2000

ISBN: (纸本)354041276X

the proceedings contain 50 papers. the special focus in this conference is on Knowledge Engineering, Case Based reasoning, Planning, Scheduling and Multi-agent Systems. the topics include: Decision-rule solutions for data mining with missing values;getting computer systems to function as team players;case-based management of software engineering experience ware;handling cases and the coverage in a limited quantity of memory for case-based planning systems;integrating rules and cases in learning via case explanation and paradigm shift;the java embedded object production system;global and local search for scheduling job shop with parallel machines;knowledge-based interactive scheduling of multiproduct batch plants;using and evaluating adaptive agents for electronic commerce negotiation;dependence based coalitions and contract net;scheduling meetings through multi-agent negotiation;agents working on the integration of heterogeneous information sources in distributed healthcare environments;solving conflicting beliefs with a distributed belief revision approach;an organizational model for multi-agent systems;evolving populations of agents with personalities in the minority game;using meta-cognitive conflicts to provoke strategic changes;sharing resource-sensitive knowledge using combinator logics;compiling default theory into extended logic programming;representing belief revision through default theories;representing operational knowledge by contextual graphs;a new distributed reinforcement learning algorithm for multiple objective optimization problems and cognitive multi-agent systems for integrated information retrieval and extraction over the web.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predicative Vagueness in Lung Metastases in Soft Tissue Sarcoma Screening 1

引用

6th international conference on Mining Intelligence and Knowledge Exploration (MIKE)

作者： Neves, Jose Dias, Almeida Morais, Ana Fonseca, Francisca Loreto, Patricia Alves, Victor Araujo, Isabel Machado, Joana Fernandes, Bruno Ribeiro, Jorge Analide, Cesar Ferraz, Filipa Neves, Joao Vicente, Henrique Univ Minho Ctr Algoritmi Braga Portugal Inst Univ Ciencias Saude CESPU Gandra Portugal Univ Minho Dept Informat Escola Engn Braga Portugal Farm Lamacaes Braga Portugal Inst Politecn Viana do Castelo ARC4DigiT Appl Res Ctr Digital Transformat Escola Super Tecnol & Gestao Viana Do Castelo Portugal Mediclin Arabian Ranches POB 282602 Dubai U Arab Emirates Univ Evora Ctr Quim Evora Dept Quim Escola Ciencias & Tecnol Evora Portugal

ISBN: (数字)9783030059187

ISBN: (纸本)9783030059187;9783030059170

Soft Tissue Sarcomas (STSs) pose a potential risk for the development of lung metastases, which in turn results in a negative prognosis for patients. Presumptions about the occurrence of these abnormalities during STSs treatment would have countless implications for both patients and healthcare professionals as they could increase the efficacy of the treatment and improve overall survival. Prediction is based on a creative logic programming, Case Based reasoning approach to problem solving, that is complemented with an unusual approach to Knowledge Representation and reasoning, as it takes into consideration not only the data items entropic states but introduces the concept of Vague's Predicate Extension.

关键词： Tissue Sarcoma Magnetic Resonance Imaging logic programming Knowledge Representation and reasoning Case Based reasoning Entropy Predicative Vagueness

来源：评论

学校读者我要写书评

暂无评论

Mathematical applications of inductive logic programming

引用

MACHINE LEARNING 2006年第1-3期64卷 25-64页

作者： Colton, Simon Muggleton, Stephen Univ London Imperial Coll Sci Technol & Med Dept Comp Computat Bioinformat Lab London SW7 2AZ England

the application of Inductive logic programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have driven the development of ILP systems. the application of AI techniques to mathematical discovery tasks, however, has largely involved computer algebra systems and theorem provers rather than machine learning systems. We discuss here the application of the HR and Progol machine learning programs to discovery tasks in mathematics. While Progol is an established ILP system, HR has historically not been described as an ILP system. However, many applications of HR have required the production of first order hypotheses given data expressed in a Prolog-style manner, and the core functionality of HR can be expressed in ILP terminology. In Colton (2003), we presented the first partial description of HR as an ILP system, and we build on this work to provide a full description here. HR performs a novel ILP routine called Automated theory Formation, which combines inductive and deductive reasoning to form clausal theories consisting of classification rules and association rules. HR generates definitions using a set of production rules, interprets the definitions as classification rules, then uses the success sets of the definitions to induce hypotheses from which it extracts association rules. It uses third party theorem provers and model generators to check whether the association rules are entailed by a set of user supplied axioms. HR has been applied successfully to a number of predictive, descriptive and subgroup discovery tasks in domains of pure mathematics. We survey various applications of HR which have led to it producing number theory results worthy of journal publication, graph theory results rivalling those of the highly successful Graffiti program and algebraic results leading to novel classification theorems. To further promote mathematics as a challenge domain for ILP systems, we present

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automated Deduction – CADE-19 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Franz Baader

ISBN: (数字)9783540450856

ISBN: (纸本)9783540405597

this volume contains the papers presented at the 19th international conference on Automated Deduction (CADE-19) held 28 July–2 August 2003 in Miami Beach, Florida, USA. they are divided into the following categories: – 4 contributions by invited speakers: one full paper and three short abstracts; – 29 accepted technical papers; – 7 descriptions of automated reasoning systems. these proceedings also contain a short description of the automated theor- proving system competition (CASC-19) organized by Geo? Sutcli?e and Chr- tian Suttner. Despite many competing smaller conferences and workshops covering di?- entaspectsofautomateddeduction,CADEisstillthemajorforumfordiscussing new results on all aspects of automated deduction as well as presenting new s- tems and improvements of established systems. In contrast to the previous year, when CADE was one of the conferences participating in the third Federated logic conference (FLoC 2002), and next year, when CADE will be part of the Second international Joint conference on Automated reasoning (IJCAR 2004), CADE-19 was organized as a stand-alone event.

关键词： Artificial Intelligence programming Languages, Compilers, Interpreters logics and Meanings of Programs Mathematical logic and Formal Languages

来源：评论

学校读者我要写书评

暂无评论

Design of mineral deposit prediction expert system based on GIS and answer set programming

Design of mineral deposit prediction expert system based on ...

引用

international conference on Geoinformatics

作者： Zengyu Zhao Huogen Chen Mao Pan Zhihu Zhang Geological Survey of Jiangsu Province Nanjing 210049 China Peking University Beijing Beijing CN China Electronics Technology Group Corp 14th Research Institute Nanjing Jiangsu CN

ISBN: (纸本)9781467376648

the past mineral deposit prediction expert systems cannot support nonmonotonic reasoning. this article introduces answer set programming, which is a well-known formalism in artificial intelligence, to design an expert system for mineral deposit prediction. the system includes GIS spatial database, fact generator, temporary fact library, fact management module, knowledge based management module, knowledge base, reasoning machine, and explanation module. the incomplete deposit knowledge and nonmonotonic reasoning is supported in the system. To demonstrate the feasibility of our approach, we illustrate how to represent deposit information in the form of logic programs and how to make reasoning according to the answer set semantics by an example of the prospecting model of porphyrite iron. the processing of ore deposit predicting is a typical example of nonmonotonic reasoning. As we got more information, we found that the original conclusion was wrong, then we revised our conclusion. Such behavior is supported in our system but is not supported in previous similar systems.

关键词： Cognition Computational modeling Minerals programming

来源：评论

学校读者我要写书评

暂无评论

EP-SPARQL: A unified language for event processing and stream reasoning 11

EP-SPARQL: A unified language for event processing and strea...

引用

20th international conference on World Wide Web, WWW 2011

作者： Anicic, Darko Fodor, Paul Rudolph, Sebastian Stojanovic, Nenad FZI Research Center for Information Technology Karlsruhe Germany Stony Brook University Stony Brook NY United States Karlsruhe Institute of Technology Karlsruhe Germany

ISBN: (纸本)9781450306324

Streams of events appear increasingly today in various Web applications such as blogs, feeds, sensor data streams, geospatial information, on-line financial data, etc. Event Processing (EP) is concerned with timely detection of compound events within streams of simple events. State-of-the-art EP provides on-the-y analysis of event streams, but cannot combine streams with background knowledge and cannot perform reasoning tasks. On the other hand, semantic tools can effectively handle background knowledge and perform reasoning thereon, but cannot deal with rapidly changing data provided by event streams. To bridge the gap, we propose Event Processing SPARQL (EP-SPARQL) as a new language for complex events and Stream reasoning. We provide syntax and formal semantics of the language and devise an effective execution model for the proposed formalism. the execution model is grounded on logic programming, and features effective event processing and inferencing capabilities over temporal and static knowledge. We provide an open-source prototype implementation and present a set of tests to show the usefulness and effectiveness of our approach. Copyright © 2011 by the Association for Computing Machinery, Inc. (ACM).

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Decompilation of Java bytecode to Prolog by partial evaluation

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2009年第10期51卷 1409-1427页

作者： Gomez-Zamalloa, Miguel Albert, Elvira Puebla, German Univ Complutense Madrid DSIC E-28040 Madrid Spain Tech Univ Madrid CLIP E-28660 Madrid Spain

reasoning about Java bytecode (JBC) is complicated due to its unstructured control-flow, the use of three-address code combined with the use of an operand stack, etc. therefore, many static analyzers and model checkers for JBC first convert the code into a higher-level representation. In contrast to traditional decompilation, such representation is often not Java source, but rather some intermediate language which is a good input for the subsequent phases of the tool. Interpretive decompilation consists in partially evaluating an interpreter for the compiled language (in this case JBC) written in a high-level language with respect to the code to be decompiled. there have been proofs-of-concept that interpretive decompilation is feasible, but there remain important open issues when it comes to decompile a real language such as JBC. this paper presents, to the best of our knowledge, the first modular scheme to enable interpretive decompilation of a realistic programming language to a high-level representation, namely of JBC to Prolog. We introduce two notions of optimality, which together require that decompilation does not generate code more than once for each program point. We demonstrate the impact of our modular approach and optimality issues on a series of realistic benchmarks. Decompilation times and decompiled program sizes are! linear with the size of the input bytecode program. this demonstrates empirically the scalability, of modular decompilation of JBC by partial evaluation. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Program transformation Partial evaluation Decompilation Interpreters Java bytecode logic programming

来源：评论

学校读者我要写书评

暂无评论

7th JSAI international Symposium on Artificial Intelligence, JSAI-isAI 2015

7th JSAI International Symposium on Artificial Intelligence,...

引用

7th JSAI international Symposium on Artificial Intelligence, JSAI-isAI 2015

ISBN: (纸本)9783319509525

the proceedings contain 39 papers. the special focus in this conference is on Artificial Intelligence. the topics include: Towards a probabilistic analysis for conditionals and unconditionals;an inference problem set for evaluating semantic theories and semantic processing systems for Japanese;applicative abstract categorial grammars in full swing;scope parallelism in coordination in dependent type semantics;discourse particles as CCP-modifiers: German doch and ja as context filters;tracking down disjunction;the meaning and use of the Japanese counter-expectational adverbs;evaluative predicates and evaluative uses of ordinary predicates;strong permission in prescriptive causal models;truth as a logical connective;abductive logic programming for normative reasoning and ontologies;a belief revision technique to model civil code updates;using ontologies to model data protection requirements in workflows;utilization of multi-word expressions to improve statistical machine translation of statutory sentences;argumentation support tool with reliability-based argumentation framework;applying a convolutional neural network to legal question answering;lexical-morphological modeling for legal text analysis;on the issue of argumentation and informedness;on the interpretation of assurance case arguments;learning argument acceptability from abstract argumentation frameworks;designing intelligent sleep analysis systems for automated contextual exploration on personal sleep-tracking data;a comparative study of similarity measures for time series classification;extracting propagation patterns from bacterial culture data in medical facility;aggregating and analyzing articles and comments on a news website;feasibility of collaborative learning and work between robots and children with autism spectrum disorders.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：