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

20th Australasian Computing Education conference, ACE 2018

ISBN: (纸本)9781450363402

the proceedings contain 14 papers. the topics discussed include: advertising CS/IT courses to female students in Australia;cohorts and cultures: developing future design thinkers;fostering creativity and innovation in the computing curriculum;using unstructured practice plus reflection to develop programming/problem-solving fluency;is the ATAR a useful predictor of success in ICT? an empirical study;comparing sequential and parallel code review techniques for formative feedback;intelligent tutoring systems for programming education: a systematic review;a comparative study of online and face-to-face embedded systems learning course;understanding semantic style by analysing student code;common logic errors made by novice programmers;learning programming, syntax errors and institution-specific factors;how to teach 'modern C++' to someone who already knows programming;representative names of computing degree programs worldwide;and informing students about academic integrity in programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

20th international conference on Formal Engineering Methods, ICFEM 2018

20th International Conference on Formal Engineering Methods,...

引用

20th international conference on Formal Engineering Methods, ICFEM 2018

ISBN: (纸本)9783030024499

the proceedings contain 37 papers. the special focus in this conference is on Formal Engineering Methods. the topics include: CDGDroid: Android malware detection based on deep learning using CFG and DFG;strongly typed numerical computations;type capabilities for object-oriented programming languages;capabilities: effects for free;a framework for interactive verification of architectural design patterns in isabelle/hol;Formalization of symplectic geometry in HOL-light;using theorem provers to increase the precision of dependence analysis for information flow control;preserving liveness guarantees from synchronous communication to asynchronous unstructured low-level languages;deriving mode logic for autonomous resilient systems;behaviour-driven formal model development;UTP semantics for bigrtimo;analysis on strategies of superposition refinement of Event-B specifications;formalising extended finite state machine transition merging;checking activity transition systems with back transitions against assertions;Towards trustworthy AI for autonomous systems;towards dependable and explainable machine learning using automated reasoning;modeling and verification of component connectors;model based testing of cyber-physical systems;service-oriented design and verification of hybrid control systems;developing reliable component-based software in mediator;the foul adversary: Formal models;model checking nash-equilibrium - automatic verification of robustness in distributed systems;analyzing security and privacy in design and implementation of web authentication protocols;combining deep learning and probabilistic model checking in sports analytics;security analysis of smart home implementations;principled greybox fuzzing;Engineering software for modular formalisation and verification of STV algorithms;towards building a generic vulnerability detection platform by combining scalable attacking surface analysis and directed fuzzing;formalising performance guarantees in meta-reinforc

关键词：

来源：评论

学校读者我要写书评

暂无评论

Achievements in answer set programming

引用

thEORY AND PRACTICE OF logic programming 2017年第5-6期17卷 961-973页

作者： Lifschitz, Vladimir Univ Texas Austin Austin TX 78712 USA

this paper describes an approach to the methodology of answer set programming that can facilitate the design of encodings that are easy to understand and provably correct. Under this approach, after appending a rule or a small group of rules to the emerging program, we include a comment that states what has been "achieved" so far. this strategy allows us to set out our understanding of the design of the program by describing the roles of small parts of the program in a mathematically precise way.

关键词： answer set programming teaching logic programming programming methodology

来源：评论

学校读者我要写书评

暂无评论

A new algorithm to automate inductive learning of default theories

引用

thEORY AND PRACTICE OF logic programming 2017年第5-6期17卷 1010-1026页

作者： Shakerin, Farhad Salazar, Elmer Gupta, Gopal Univ Texas Dallas Richardson TX 75083 USA

In inductive learning of a broad concept, an algorithm should be able to distinguish concept examples from exceptions and noisy data. An approach through recursively finding patterns in exceptions turns out to correspond to the problem of learning default theories. Default logic is what humans employ in common-sense reasoning. therefore, learned default theories are better understood by humans. In this paper, we present new algorithms to learn default theories in the form of non-monotonic logic programs. Experiments reported in this paper show that our algorithms are a significant improvement over traditional approaches based on inductive logic programming. Under consideration for acceptance in TPLP.

关键词： inductive logic programming non-monotonic logic programming default reasoning common-sense reasoning machine learning

来源：评论

学校读者我要写书评

暂无评论

Annotated defeasible logic

引用

thEORY AND PRACTICE OF logic programming 2017年第5-6期17卷 819-836页

作者： Governatori, Guido Maher, Michael J. CSIRO Data61 Brisbane Qld Australia Reasoning Res Inst Canberra ACT Australia

Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. there is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial ways. this limits their usefulness in contexts where different intuitions are at play in different aspects of a problem. In particular, in some legal settings, different actors have different burdens of proof, which might be expressed as reasoning in different defeasible logics. In this paper, we introduce annotated defeasible logic as a flexible formalism permitting multiple forms of defeasibility, and establish some properties of the formalism.

关键词： defeasible logic non-monotonic reasoning annotated logics legal reasoning

来源：评论

学校读者我要写书评

暂无评论

the intricacies of three-valued extensional semantics for higher-order logic programs

引用

thEORY AND PRACTICE OF logic programming 2017年第5-6期17卷 974-991页

作者： Rondogiannis, Panos Symeonidou, Ioanna Univ Athens Athens Greece

M. Bezem defined an extensional semantics for positive higher-order logic programs. Recently, it was demonstrated by Rondogiannis and Symeonidou that Bezem's technique can be extended to higher-order logic programs with negation, retaining its extensional properties, provided that it is interpreted under a logic with an infinite number of truth values. Rondogiannis and Symeonidou also demonstrated that Bezem's technique, when extended under the stable model semantics, does not in general lead to extensional stable models. In this paper, we consider the problem of extending Bezem's technique under the well-founded semantics. We demonstrate that the well-founded extension fails to retain extensionality in the general case. On the positive side, we demonstrate that for stratified higher-order logic programs, extensionality is indeed achieved. We analyze the reasons of the failure of extensionality in the general case, arguing that a three-valued setting cannot distinguish between certain predicates that appear to have a different behaviour inside a program context, but which happen to be identical as three-valued relations.

关键词： Extensional higher-order logic programming Negation in logic programming

来源：评论

学校读者我要写书评

暂无评论

Achievements in answer set programming

Achievements in answer set programming

引用

33rd international conference on logic programming colocated with the 23rd international conference on Principles and Practice of Constraint programming / 20th international conference on theory and Applications of Satisfiability Testing

作者： Lifschitz, Vladimir Univ Texas Austin Austin TX 78712 USA

关键词： answer set programming teaching logic programming programming methodology

来源：评论

学校读者我要写书评

暂无评论

logic programming approaches for routing fault-free and maximally parallel wavelength-routed optical networks-on-chip (Application paper)

引用

thEORY AND PRACTICE OF logic programming 2017年第5-6期17卷 800-818页

作者： Gavanelli, Marco Nonato, Maddalena Peano, Andrea Bertozzi, Davide Ferrara Univ Dept Engn Ferrara Italy QuanTek Bologna Italy

One promising trend in digital system integration consists of boosting on-chip communication performance by means of silicon photonics, thus materializing the so-called Optical Networkson- Chip. Among them, wavelength routing can be used to route a signal to destination by univocally associating a routing path to the wavelength of the optical carrier. Such wavelengths should be chosen so to minimize interferences among optical channels and to avoid routing faults. As a result, physical parameter selection of such networks requires the solution of complex constrained optimization problems. In previous work, published in the proceedings of the international conference on Computer-Aided Design, we proposed and solved the problem of computing the maximum parallelism obtainable in the communication between any two endpoints while avoiding misrouting of optical signals. the underlying technology, only quickly mentioned in that paper, is Answer Set programming. In this work, we detail the Answer Set programming approach we used to solve such problem. Another important design issue is to select the wavelengths of optical carriers such that they are spread across the available spectrum, in order to reduce the likelihood that, due to imperfections in the manufacturing process, unintended routing faults arise. We show how to address such problem in Constraint logic programming on Finite Domains.

关键词： Answer set programming logic programming applications Optical networks-on-chip Constrained optimization Constraint logic programming on finite domains

来源：评论

学校读者我要写书评

暂无评论

Productive corecursion in logic programming

引用

thEORY AND PRACTICE OF logic programming 2017年第5-6期17卷 906-923页

作者： Komendantskaya, Ekaterina Li, Yue Heriot Watt Univ Edinburgh Midlothian Scotland

logic programming is a Turing complete language. As a consequence, designing algorithms that decide termination and non-termination of programs or decide inductive/ coinductive soundness of formulae is a challenging task. For example, the existing state-of-the-art algorithms can only semi-decide coinductive soundness of queries in logic programming for regular formulae. Another, less famous, but equally fundamental and important undecidable property is productivity. If a derivation is infinite and coinductively sound, we may ask whether the computed answer it determines actually computes an infinite formula. If it does, the infinite computation is productive. this intuition was first expressed under the name of computations at infinity in the 80s. In modern days of the Internet and stream processing, its importance lies in connection to infinite data structure processing. Recently, an algorithm was presented that semi-decides a weaker property -of productivity of logic programs. A logic program is productive if it can give rise to productive derivations. In this paper, we strengthen these recent results. We propose a method that semi-decides productivity of individual derivations for regular formulae. thus, we at last give an algorithmic counterpart to the notion of productivity of derivations in logic programming. this is the first algorithmic solution to the problem since it was raised more than 30 years ago. We also present an implementation of this algorithm.

关键词： Horn clauses (co) recursion (co) induction infinite term trees productivity

来源：评论

学校读者我要写书评

暂无评论

Computing LP^MLN using ASP and MLN solvers

引用

thEORY AND PRACTICE OF logic programming 2017年第5-6期17卷 942-960页

作者： Lee, Joohyung Talsania, Samidh Wang, Yi Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85281 USA

LPMLN is a recent addition to probabilistic logic programming languages. Its main idea is to overcome the rigid nature of the stable model semantics by assigning a weight to each rule in a way similar to Markov logic is defined. We present two implementations of LPMLN, LPMLN2ASP and LPMLN2MLN. System LPMLN2ASP translates LPMLN programs into the input language of answer set solver CLINGO, and using weak constraints and stable model enumeration, it can compute most probable stable models as well as exact conditional and marginal probabilities. System LPMLN2MLN translates LPMLN programs into the input language of Markov logic solvers, such as alchemy, TUFFY, and ROCKIT, and allows for performing approximate probabilistic inference on LPMLN programs. We also demonstrate the usefulness of the LPMLN systems for computing other languages, such as ProbLog and Pearl's Causal Models, that are shown to be translatable into LPMLN.

关键词： Answer Set programming Markov logic LPMLN

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：