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

Proceedings of the 11th international conference on Autonomous Agents and Multiagent Systems - Volume 3

作者： Ricardo Gonçalves José Júlio Alferes Universidade Nova de Lisboa Portugal

In this paper we propose the usage of a framework combining standard deontic logic (SDL) and non-monotonic logic programming -- deontic logic programs (DLP) -- to represent and reason about normative systems.

ISBN: (纸本)9780981738130

关键词： design languages for agent systems knowledge representation logic-based approaches and methods norms organisations and institutions

来源：评论

学校读者我要写书评

暂无评论

Prioritized Sequent-Based Argumentation 18

Prioritized Sequent-Based Argumentation

引用

Proceedings of the 17th international conference on Autonomous Agents and MultiAgent Systems

作者： Ofer Arieli AnneMarie Borg Christian Straßer Tel-Aviv Academic College Tel-Aviv Israel Ruhr-University Bochum Bochum Germany

In this paper we integrate priorities in sequent-based argumentation. the former is a useful and extensively investigated tool in the context of non-monotonic reasoning, and the latter is a modular and general way of handling logical argumentation. their combination offers a platform for representing and reasoning with maximally consistent subsets of prioritized knowledge bases. Moreover, many frameworks of the resulting formalisms satisfy common rationality postulates and other desirable properties, like conflict preservation.

关键词： sequent calculi dung-semantics maximally consistent subsets priorities structured argumentation nonmonotonic logic

来源：评论

学校读者我要写书评

暂无评论

Deontic logic Programs 13

Deontic Logic Programs

引用

international conference on Autonomous Agents and Multiagent Systems

作者： Ricardo Goncalves Jose Julio Alferes CENTRIA - Faculdade Ciências e Tecnologia Universidade Nova de Lisboa Portugal Lisbon Portugal

ISBN: (纸本)9781450319935

Deontic logic programming (DLP) is a framework combining deontic logic and non-monotonic logic programming, and it is useful to represent and reason about normative systems. In this paper we propose an implementation for reasoning in DLP that combines, in a modular way, a reasoner for deontic logic with a reasoner for stable model semantics.

关键词： Norms Knowledge representation Environments Social and organisational structure logic-based approaches and methods Design languages for agent systems

来源：评论

学校读者我要写书评

暂无评论

Poster: reasoning Based on Imperfect Context Data in Adaptive Security

Poster: Reasoning Based on Imperfect Context Data in Adaptiv...

引用

international conference on Software Engineering (ICSE)

作者： Sara Sartoli Akbar Siami Namin Computer Science Department Texas Tech University Lubbock TX USA

Enabling software systems to adjust their protection in continuously changing environments with imperfect context information is a grand challenging problem. the issue of uncertain reasoning based on imperfect information has been overlooked in traditional logic programming with classical negation when applied to dynamic systems. this paper sketches a non-monotonic approach based on Answer Set programming to reason with imperfect context data in adaptive security where there is little or no knowledge about certainty of the actions and events.

关键词： Context Security Cognition Adaptation models Monitoring Context modeling Patents

来源：评论

学校读者我要写书评

暂无评论

17th international conference on Computational Methods in Systems Biology, CMSB 2019

17th International Conference on Computational Methods in Sy...

引用

17th international conference on Computational Methods in Systems Biology, CMSB 2019

ISBN: (纸本)9783030313036

the proceedings contain 32 papers. the special focus in this conference is on Computational Methods in Systems Biology. the topics include: Reachability Design through Approximate Bayesian Computation;fast Enumeration of non-isomorphic Chemical Reaction Networks;a Large-Scale Assessment of Exact Model Reduction in the BioModels Repository;computing Difference Abstractions of Metabolic Networks Under Kinetic Constraints;BRE:IN - A Backend for reasoning About Interaction Networks with Temporal logic;the Kappa Simulator Made Interactive;biochemical Reaction Networks with Fuzzy Kinetic Parameters in Snoopy;compartmental Modeling Software: A Fast, Discrete Stochastic Framework for Biochemical and Epidemiological Simulation;spike – Reproducible Simulation Experiments with Configuration File Branching;sequential Reprogramming of Biological Network Fate;KAMIStudio: An Environment for Biocuration of Cellular Signalling Knowledge;A New Version of DAISY to Test Structural Identifiability of Biological Models;semi-quantitative Abstraction and Analysis of Chemical Reaction Networks (Extended Abstract);bayesian Parameter Estimation for Stochastic Reaction Networks from Steady-State Observations;wasserstein Distances for Estimating Parameters in Stochastic Reaction Networks;on Inferring Reactions from Data Time Series by a Statistical Learning Greedy Heuristics;Barbaric Robustness Monitoring Revisited for STL* in Parasim;Symmetry Breaking for GATA-1/PU.1 Model;scalable Control of Asynchronous Boolean Networks;Transcriptional Response of SK-N-AS Cells to Methamidophos (Extended Abstract);control Variates for Stochastic Simulation of Chemical Reaction Networks;separators for Polynomial Dynamic Systems with Linear Complexity;bounding First Passage Times in Chemical Reaction Networks: Poster Abstract;data-Informed Parameter Synthesis for Population Markov Chains;effective Computational Methods for Hybrid Stochastic Gene Networks;designing Distributed Cell Classifier Circuits Using a G

关键词：

来源：评论

学校读者我要写书评

暂无评论

Synthesis of multi-level pipelines for programmable logic devices

Synthesis of multi-level pipelines for programmable logic de...

引用

international conference on Telecommunications (ICT)

作者： Issam Damaj Division of Sciences and Engineering American University of Kuwait Safat Kuwait

Recently, hardware and software engineers have been showing considerable attention to high-level parallelization and hardware synthesis methodologies. State-of-the-art approaches have benefited from the emergence of modern high-density Field Programmable Gate Arrays. In this paper, we explore the effectiveness of a formal methodology in the design of pipelined versions of a matrix multiplication algorithm. the suggested methodology adopts a functional programming notation for specifying algorithms and for reasoning about them. the parallel behavior of the specification is then derived and mapped onto hardware. Several pipelined implementations are developed with different performance characteristics. the refined designs are tested under Agility's RC-1000 reconfigurable computer with its 2 million gates Virtex-E FPGA. Performance analysis and evaluation of the proposed implementations are presented in comparison with an Intel Core 2 DUO processor.

关键词： Pipelines Programmable logic devices Hardware Field programmable gate arrays Programmable logic arrays Design methodology Algorithm design and analysis Functional programming Testing Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2010年 6397 LNCS卷 VI页

作者： Fermüller, Christian G. Voronkov, Andrei TU Wien Institut für Computersprachen 185.2 Theory and Logic Group Favoritenstraße 9-11 A-1040 Vienna Austria University of Manchester School of Computer Science Kilburn Building Oxford Road Manchester M13 9PL United Kingdom

来源：评论

学校读者我要写书评

暂无评论

BQM: a system integrating logic, objects, and non-monotonic reasoning

BQM: a system integrating logic, objects, and non-monotonic ...

引用

international conference on Tools for Artificial Intelligence (ICTAI)

作者： N. Leone P. Rullo ISI CNR-c/o DEIS-UNICAL Rende Italy DIMET Universita di Reggio Calabria Reggio Calabria Italy

the BQM system extends deductive database technology with knowledge structuring capabilities to provide an advanced environment for the development of data and knowledge-based applications. the system relies on a knowledge representation language that combines the declarativeness of logic programming with the notions of object, inheritance with exceptions and message passing. Exceptions are supported by allowing rules with negated heads. the use of exceptions inside the inheritance mechanism makes the language inherently nonmonotonic. the paper describes BQM focusing on both the language and the implementation techniques. An informal overview of the language is first given. then, a number of techniques for efficient query evaluation are presented. these techniques significantly extend "traditional" deductive database query evaluation strategies to deal with nonmonotonic reasoning. A description of the architecture of the current prototype of the BQM system is also given.

关键词： Deductive databases logic programming Query processing Knowledge representation Message passing Magnetic heads Prototypes Object oriented databases Data models Database systems

来源：评论

学校读者我要写书评

暂无评论

Lifted MAP Inference for Markov logic Networks 17

Lifted MAP Inference for Markov Logic Networks

引用

17th international conference on Artificial Intelligence and Statistics (AISTATS)

作者： Sarkhel, Somdeb Venugopal, Deepak Singla, Parag Gogate, Vibhav Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA IIT Delhi Dept CSE New Delhi India

In this paper, we present a new approach for lifted MAP inference in Markov logic Networks (MLNs). Our approach is based on the following key result that we prove in the paper: if an MLN has no shared terms then MAP inference over it can be reduced to MAP inference over a Markov network having the following properties: (i) the number of random variables in the Markov network is equal to the number of first-order atoms in the MLN;and (ii) the domain size of each variable in the Markov network is equal to the number of groundings of the corresponding first-order atom. We show that inference over this Markov network is exponentially more efficient than ground inference, namely inference over the Markov network obtained by grounding all first-order atoms in the MLN. We improve this result further by showing that if non-shared MLNs contain no self joins, namely every atom appears at most once in each of its formulas, then all variables in the corresponding Markov network need only be bi-valued. Our approach is quite general and can be easily applied to an arbitrary MLN by simply grounding all of its shared terms. the key feature of our approach is that because we reduce lifted inference to propositional inference, we can use any propositional MAP inference algorithm for performing lifted MAP inference. Within our approach, we experimented with two propositional MAP inference algorithms: Gurobi and MaxWalkSAT. Our experiments on several benchmark MLNs clearly demonstrate our approach is superior to ground MAP inference in terms of scalability and solution quality.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Model Checking and non-standard Multi-objective reasoning

Probabilistic Model Checking and Non-standard Multi-objectiv...

引用

17th international conference on the Foundations of Software Science and Computation Structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of Software (ETAPS)

作者： Baier, Christel Dubslaff, Clemens Klueppelholz, Sascha Daum, Marcus Klein, Joachim Maercker, Steffen Wunderlich, Sascha Tech Univ Dresden Inst Theoret Comp Sci Dresden Germany

ISBN: (纸本)9783642548048;9783642548031

Probabilistic model checking is a well-established method for the automated quantitative system analysis. It has been used in various application areas such as coordination algorithms for distributed systems, communication and multimedia protocols, biological systems, resilient systems or security. In this paper, we report on the experiences we made in inter-disciplinary research projects where we contribute with formal methods for the analysis of hardware and software systems. Many performance measures that have been identified as highly relevant by the respective domain experts refer to multiple objectives and require a good balance between two or more cost or reward functions, such as energy and utility. the formalization of these performance measures requires several concepts like quantiles, conditional probabilities and expectations and ratios of cost or reward functions that are not supported by state-of-the-art probabilistic model checkers. We report on our current work in this direction, including applications in the field of software product line verification.

关键词： Formal methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：