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

Extended Floyd-Hoare logic over Relational Nominative Data 13th

Extended Floyd-Hoare Logic over Relational Nominative Data

13th international conference on Information and Communication Technologies in Education, Research, and Industrial Applications (ICTERI)

作者： Nikitchenko, Mykola Ivanov, Ievgen Kornilowicz, Artur Kryvolap, Andrii Taras Shevchenko Natl Univ Kyiv 64-13 Volodymyrska St UA-01601 Kiev Ukraine Univ Bialystok Inst Informat Ciolkowskiego 1M PL-15245 Bialystok Poland

ISBN: (纸本)9783319761688

the classical Floyd-Hoare logic is defined for the case of total pre- and postconditions and partial programs (i.e. programs can be undefined on some input data, but conditions must be defined on all data). In this paper we propose an extension of this logic for the case of partial conditions and partial programs over structured data. these data are based on two constructing primitives: naming and relational structuring and are called relational nominative data. they can conveniently represent many data structures used in programming. the semantics of the proposed logic is represented by special algebras of partial functions and predicates over relational nominative data. Operations of these algebras are called compositions. We present an inference system for the mentioned logic and propose an approach to its formalization in Mizar proof assistant. the obtained results can be used in software verification.

关键词： Formal methods Software verification Floyd-Hoare logic Proof assistant Nominative data Partial table Relational database

来源：评论

学校读者我要写书评

暂无评论

An Instance Based Model for Scalable θ-Subsumption

引用

international JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS 2018年第7期27卷

作者： Leger, Hippolyte Bouthinon, Dominique Lebbah, Mustapha Azzag, Hanene Univ Paris 13 LIPN UMR CNRS 7030 99 Ave Jean Baptiste Clement F-93430 Villetaneuse France

the theta-subsumption test is known to be a bottleneck in inductive logic programming. the state-of-the-art learning systems in this field are hardly scalable. Last year, we have created a distributed theta-subsumption process based on an Actor Model, with the aim of being able to decide subsumption on very large clauses. this model was correct and complete, but was also very slow. this is why we introduce ANTS (Actor Network based theta-Subsumption), a new model also based on an actor network, which is significantly faster than the previous one.

关键词： theta-subsumption inductive logic programming actor model distributed computing Akka

来源：评论

学校读者我要写书评

暂无评论

the Sixth Answer Set programming Competition

引用

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH 2017年第1期60卷 41-95页

作者： Gebser, Martin Maratea, Marco Ricca, Francesco Univ Potsdam IfICS August Bebel Str 89 D-14482 Potsdam Germany Univ Genoa DIBRIS Viale F Causa 15 I-16145 Genoa Italy Univ Calabria DeMaCS Viale P BucciCubo 31B I-87036 Arcavacata Di Rende Italy

Answer Set programming (ASP) is a well-known paradigm of declarative programming with roots in logic programming and non-monotonic reasoning. Similar to other closely related problem-solving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advancements in ASP solving are assessed in competition events. In this paper, we report about the design and results of the Sixth ASP Competition, which was jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genoa (Italy), in affiliation with the 13th international conference on logic programming and Non-Monotonic Reasoning. this edition maintained some of the design decisions introduced in 2014, e.g., the conception of sub-tracks, the scoring scheme, and the adherence to a fixed modeling language in order to push the adoption of the ASP-Core-2 standard. On the other hand, it featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a "Marathon" track where the top-performing systems are given more time for solving hard benchmarks.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Towards Certified Meta-programming with Typed TEMPLATE-COQ 1

引用

9th international conference on Interactive theorem Proving (ITP) Held as Part of the Federated logic conference (FloC)

作者： Anand, Abhishek Boulier, Simon Cohen, Cyril Sozeau, Matthieu Tabareau, Nicolas Cornell Univ Ithaca NY 14850 USA Inria Nantes Gallinette Project Team Rennes France Univ Cote Azur INRIA Nice France Inria Paris Pi R2 Project Team Paris France IRIF Paris France

ISBN: (数字)9783319948218

ISBN: (纸本)9783319948218;9783319948201

TEMPLATE-COQ (https://***/template-coq) is a plugin for COQ, originally implemented by Malecha [18], which provides a reifier for COQ terms and global declarations , as represented in the COQ kernel, as well as a denotation command. Initially, it was developed for the purpose of writing functions on COQ's AST in GAL-LINA. Recently, it was used in the CERTICOQ certified compiler project [4], as its front-end language, to derive parametricity properties [3], and to extract COQ terms to a CBV lambda-calculus [13]. However, the syntax lacked semantics, be it typing semantics or operational semantics, which should reflect, as formal specifications in COQ, the semantics of COQ's type theory itself. the tool was also rather bare bones, providing only rudimentary quoting and unquoting commands. We generalize it to handle the entire Calculus of inductive Constructions (CIC), as implemented by COQ, including the kernel's declaration structures for definitions and inductives, and implement a monad for general manipulation of COQ'S logical environment. We demonstrate how this setup allows COQ users to define many kinds of general purpose plugins, whose correctness can be readily proved in the system itself, and that can be run efficiently after extraction. We give a few examples of implemented plugins, including a parametricity translation. We also advocate the use of TEMPLATE-COQ as a foundation for higher-level tools.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Development of Methods and Algorithms Based on Object-Oriented logic programming for Video Monitoring of Laboratory Rodents 13

Development of Methods and Algorithms Based on Object-Orient...

引用

13th international conference on Signal-Image Technology and Internet-Based Systems (SITIS)

作者： Morozov, Alexei A. Sushkova, Olga S. Vaniya, Sandipkumar M. RAS Kotelnikov Inst Radio Engn & Elect Mokhovaya 11-7 Moscow 125009 Russia Cent Salt & Marine Chem Res Inst Gijubhai Badheka Marg Bhavnagar 364002 Gujarat India

ISBN: (纸本)9781538642832

the problem of video monitoring of laboratory rodents by the means of object-oriented logic programming is considered. the videos are produced in neurophysiological experiments on the study of convulsive electrical activity of the brain cortex. Videos of behaviour of laboratory rats were recorded simultaneously with electroencephalograms (EEG) in the animals. A comparison of EEG data with the behaviour of the animals is necessary because sharp motions of the animals can result in EEG signals that are very similar to the epileptic discharges. thus, the first task of the video monitoring is recognition of the sharp motions of the animals and using this information for proper interpretation of the results of the experiments. the second task of the video monitoring is analysis of behaviour of animals in cognitive testing. Essential feature of the video records is in that the experiments are conducted in the same cage where the animal lives, that is, the background of the cage is sawdust. the colour of the animals is about the same as the colour of the sawdust;thus the detection of the animals is not a simple task. In the paper, development of low-level algorithms for video analysis as well as logical methods for the analysis of the animal behaviour is discussed. the methods and algorithms are implemented in the Actor Prolog object-oriented logic language.

关键词： intelligent video surveillance intelligent video monitoring laboratory animals neurophysiological experiment rodent rat behaviour analysis Actor Prolog object-oriented logic programming Prolog to Java translation

来源：评论

学校读者我要写书评

暂无评论

A new model for scalable Θ-subsumption 26

A new model for scalable Θ-subsumption

引用

26th international conference on inductive logic programming (Short Papers), ILP 2016

作者： Leger, Hippolyte Bouthinon, Dominique Lebbah, Mustapha Azzag, Hanane Universite Paris 13 Sorbonne Paris Cite L.I.P.N UMR-CNRS 7030 VilletaneuseF-93430 France

the Θ-subsumption test is known to be a bottleneck in inductive logic programming. the state-of-the-art learning systems in this field are hardly scalable. So we introduce a new Θ-subsumption algorithm based on an Actor Model, with the aim of being able to decide subsumption on very large clauses. We use Akka, a powerful tool to build distributed actor systems based on the JVM and the Scala language.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A new model for single machine scheduling with uncertain processing time

引用

JOURNAL OF INTELLIGENT MANUFACTURING 2017年第3期28卷 717-725页

作者： Hu, Kai Zhang, Xingfang Gen, Mitsuo Jo, Jungbok Liaocheng Univ Sch Math Sci Liaocheng 252059 Peoples R China Tokyo Univ Sci Tokyo Japan Japan & Fuzzy Log Syst Inst Iizuka Fukuoka Japan Dongseo Univ Div Comp & Informat Engn Busan South Korea

Uncertain single machine scheduling problem for batches of jobs is an important issue for manufacturing systems. In this paper, we use uncertainty theory to study the single machine scheduling problem with deadlines where the processing times are described by uncertain variables with known uncertainty distributions. A new model for this problem is built to maximize expected total weight of batches of jobs. then the model is transformed into a deterministic integer programming model by using the operational law for inverse uncertainty distributions. In addition, a property of the transformed model is provided and an algorithm is designed to solve this problem. Finally, a numerical example is given to illustrate the effectiveness of the model and the proposed algorithm.

关键词： Integer programming Uncertainty theory Batch scheduling

来源：评论

学校读者我要写书评

暂无评论

inductive logic programming meets relational databases: Efficient learning of markov logic networks 1

引用

26th international conference on inductive logic programming, ILP 2016

作者： Malec, Marcin Khot, Tushar Nagy, James Blask, Erik Natarajan, Sriraam Indiana University Bloomington BloomingtonIN United States Allen Institute of AI Seattle United States Air Force Research Laboratory Riverside United States

ISBN: (数字)9783319633428

ISBN: (纸本)9783319633411

Statistical Relational Learning (SRL) approaches have been developed to learn in presence of noisy relational data by combining probability theory with first order logic. While powerful, most learning approaches for these models do not scale well to large datasets. While advances have been made on using relational databases with SRL models [14], they have not been extended to handle the complex model learning (structure learning task). We present a scalable structure learning approach that combines the benefits of relational databases with search strategies that employ rich inductive bias from inductive logic programming. We empirically show the benefits of our approach on boosted structure learning for Markov logic Networks. © Springer international Publishing AG 2017.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

DETECTING ANOMALOUS PROGRAMMABLE logic CONTROLLER EVENTS USING MACHINE LEARNING 13th

DETECTING ANOMALOUS PROGRAMMABLE LOGIC CONTROLLER EVENTS USI...

引用

13th IFIP WG 11.9 international conference on Digital Forensics

作者： Yau, Ken Chow, Kam-Pui Univ Hong Kong Comp Sci Hong Kong Peoples R China

ISBN: (纸本)9783319672083;9783319672076

Industrial control system failures can be hazardous to human lives and the environment. Programmable logic controllers are major components of industrial control systems that are used across the critical infrastructure. Attack and accident investigations involving programmable logic controllers rely on forensic techniques to establish the root causes and to develop mitigation strategies. However, programmable logic controller forensics is a challenging task, primarily because of the lack of system logging. this chapter proposes a novel methodology that logs the values of relevant memory addresses used by a programmable logic controller program along with their timestamps. Machine learning techniques are applied to the logged data to identify anomalous or abnormal programmable logic controller operations. An application of the methodology to a simulated traffic light control system demonstrates its effectiveness in performing forensic investigations of programmable logic controllers.

关键词： programming logic controllers forensics machine learning

来源：评论

学校读者我要写书评

暂无评论

An approach to formalization of an extension of floyd-hoare logic 13

An approach to formalization of an extension of floyd-hoare ...

引用

13th international conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer, ICTERI 2017

作者： Kornilowicz, Artur Kryvolap, Andrii Nikitchenko, Mykola Ivanov, Ievgen Institute of Informatics University of Bialystok Ciolkowskiego 1M Bialystok15-245 Poland Taras Shevchenko National University of Kyiv 64/13 Volodymyrska Street Kyiv01601 Ukraine

the classical Floyd-Hoare logic is defined for the case of total pre- and postconditions and partial programs (i.e. programs can be undefined on some input data, but conditions must be defined on all data). In this paper we propose an extension of this logic for the case of partial conditions and partial programs on hierarchically organized data. these data are based on the naming relation and are called nominative data. they can conveniently represent many data structures used in programming. the semantics of the proposed logic is represented by special algebras of partial functions and predicates over nominative data. Operations of these algebras are called compositions. We present an inference system for the mentioned logic and propose an approach to its formalization in Mizar proof assistant. the obtained results can be used in software verification.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：