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

Projection-Based Runtime Assertions for Testing and Debugging Quantum Programs

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2020年第OOPSLA期4卷 1–29页

作者： Li, Gushu Li Zhou Yu, Nengkun Ding, Yufei Ying, Mingsheng Xie, Yuan Univ Calif Santa Barbara Santa Barbara CA 93106 USA Max Planck Inst Secur & Privacy Berlin Germany Univ Technol Sydney NSW Australia Chinese Acad Sci Inst Software Beijing Peoples R China

In this paper, we propose Proq, a runtime assertion scheme for testing and debugging quantum programs on a quantum computer. The predicates in Proq are represented by projections (or equivalently, closed subspaces of the state space), following Birkhoff-von Neumann quantum logic. The satisfaction of a projection by a quantum state can be directly checked upon a small number of projective measurements rather than a large number of repeated executions. On the theory side, we rigorously prove that checking projection-based assertions can help locate bugs or statistically assure that the semantic function of the tested program is close to what we expect, for both exact and approximate quantum programs. On the practice side, we consider hardware constraints and introduce several techniques to transform the assertions, making them directly executable on the measurement-restricted quantum computers. We also propose to achieve simplified assertion implementation using local projection technique with soundness guaranteed. We compare Proq with existing quantum program assertions and demonstrate the effectiveness and efficiency of Proq by its applications to assert two sophisticated quantum algorithms, the Harrow-Hassidim-Lloyd algorithm and Shor's algorithm.

关键词： quantum computing quantum programming assertion program testing

来源：评论

学校读者我要写书评

暂无评论

Relating Two Dialects of Answer Set programming

引用

theory and practice of logic programming 2019年第5-6期19卷 1006-1020页

作者： Harrison, Amelia Lifschitz, Vladimir Google Mountain View CA 94043 USA Univ Texas Austin Austin TX 78712 USA

The input language of the answer set solver clingo is based on the definition of a stable model proposed by Paolo Ferraris. The semantics of the ASP-Core language, developed by the ASP Standardization Working Group, uses the approach to stable models due to Wolfgang Faber, Nicola Leone, and Gerald Pfeifer. The two languages are based on different versions of the stable model semantics, and the ASP-Core document requires, "for the sake of an uncontroversial semantics," that programs avoid the use of recursion through aggregates. In this paper we prove that the absence of recursion through aggregates does indeed guarantee the equivalence between the two versions of the stable model semantics, and show how that requirement can be relaxed without violating the equivalence property.

关键词： Answer set programming answer set solvers stable models aggregates

来源：评论

学校读者我要写书评

暂无评论

Using SWISH to Realize Interactive Web-based Tutorials for logic-based Languages

引用

theory and practice of logic programming 2019年第2期19卷 229-261页

作者： Wielemaker, Jan Riguzzi, Fabrizio Kowalski, Robert A. Lager, Torbjorn Sadri, Fariba Calejo, Miguel Ctr Wiskunde & Informat Amsterdam Netherlands Univ Ferrara Dept Math & Comp Sci Ferrara Italy Imperial Coll London England Univ Gothenburg Gothenburg Sweden Log Contracts Lisbon Portugal

programming environments have evolved from purely text based to using graphical user interfaces, and now we see a move toward web-based interfaces, such as Jupyter. Web-based interfaces allow for the creation of interactive documents that consist of text and programs, as well as their output. The output can be rendered using web technology as, for example, text, tables, charts, or graphs. This approach is particularly suitable for capturing data analysis workflows and creating interactive educational material. This article describes SWISH, a web front-end for Prolog that consists of a web server implemented in SWI-Prolog and a client web application written in JavaScript. SWISH provides a web server where multiple users can manipulate and run the same material, and it can be adapted to support Prolog extensions. In this article we describe the architecture of SWISH, and describe two case studies of extensions of Prolog, namely Probabilistic logic programming and logic Production System, which have used SWISH to provide tutorial sites.

关键词： Prolog logic programming system notebook interface web

来源：评论

学校读者我要写书评

暂无评论

Introduction to the TPLP Special Issue on User-oriented logic programming and Reasoning Paradigms

引用

theory and practice of logic programming 2019年第2期19卷 109-113页

作者： Ellmauthaler, Stefan Schulz, Claudia Univ Leipzig Leipzig Germany Tech Univ Darmstadt Ubiquitous Knowledge Proc UKP Lab Darmstadt Germany

With the rise of machine learning, and more recently the overwhelming interest in deep learning, knowledge representation and reasoning (KRR) approaches struggle to maintain their position within the wider Artificial Intelligence (AI) community. Often considered as part of the good old-fashioned AI (Haugeland 1985) – like a memory of glorious old days that have come to an end – many consider KRR as no longer applicable (on its own) to the problems faced by AI today (Blackwell 2015; Garnelo et al. 2016). What they see are logical languages with symbols incomprehensible by most, inference mechanisms that even experts have difficulties tracing and debugging, and the incapability to process unstructured data like text.

关键词： logic programming Reasoning

来源：评论

学校读者我要写书评

暂无评论

Modeling System Events and Negative Events Using Thinging Machines Based on Lupascian logic

arXiv

引用

arXiv 2022年

作者： Al-Fedaghi, Sabah Computer Engineering Department Kuwait University Kuwait Kuwait

- This paper is an exploration of the ontological foundations of conceptual modeling that addresses the concept of events and related notions. Development models that convey how things change over space and time demand continued attention in systems and software engineering. In this context, foundational matters in modeling systems include the definition of an event, the types of events, and the kinds of relationships that can be recognized among events. Although a broad spectrum of research of such issues exists in various fields of study, events have extensive applicability in computing (e.g., event-driven programming, architecture, data modeling, automation, and surveillance). While these computing notions are diverse, their event-based nature lets us apply many of the same software engineering techniques to all of them. In this paper, the focus is on addressing the dynamic concepts of system events and negative events. Specifically, we concentrate on what computer scientists would refer to as an event grammar and event calculus. Analyzing the concept of event would further the understanding of the event notion and provide a sound foundation for improving the theory and practice of conceptual modeling. An event in computer science has many definitions (e.g., anything that happens, changes in the properties of objects, and the occurrence of and transition between states). This paper is based upon a different conceptualization using thinging machines and Lupascian logic to define negative events. An event is defined as a time penetrated domain’s region, which is described in terms of things and five-action machines. Accordingly, samples from event grammar and event calculus are remodeled and analyzed in terms of this definition. The results point to an enriched modeling technique with an enhanced conceptualization of events that can benefit behavior modeling in systems. © 2022, CC BY.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Stable marriage problems with ties and incomplete preferences: An empirical comparison of ASP, SAT, ILP, CP, and local search methods

arXiv

引用

arXiv 2021年

作者： Eyupoglu, Selin Fidan, Muge Gulesen, Yavuz Izci, Ilayda Begum Teber, Berkan Yilmaz, Baturay Alkan, Ahmet Erdem, Esra Computer Science Faculty of Engineering and Natural Sciences Sabanci University Istanbul Turkey Economics Faculty of Arts and Social Sciences Sabanci University Istanbul Turkey

We study a variation of the Stable Marriage problem, where every man and every woman express their preferences as preference lists which may be incomplete and contain ties. This problem is called the Stable Marriage problem with Ties and Incomplete preferences (SMTI). We consider three optimization variants of SMTI, Max Cardinality, Sex-Equal and Egalitarian, and empirically compare the following methods to solve them: Answer Set programming, Constraint programming, Integer Linear programming. For Max Cardinality, we compare these methods with Local Search methods as well. We also empirically compare Answer Set programming with Propositional Satisfiability, for SMTI instances. This paper is under consideration for acceptance in theory and practice of logic programming (TPLP). Copyright © 2021, The Authors. All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Debugging Non-ground ASP Programs: Technique and Graphical Tools

引用

theory and practice of logic programming 2019年第2期19卷 290-316页

作者： Dodaro, Carmine Gasteiger, Philip Reale, Kristian Ricca, Francesco Schekotihin, Konstantin Univ Genoa DIBRIS Genoa Italy Alpen Adria Univ Klagenfurt Klagenfurt Austria Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

Answer set programming (ASP) is one of the major declarative programming paradigms in the area of logic programming and non-monotonic reasoning. Despite that ASP features a simple syntax and an intuitive semantics, errors are common during the development of ASP programs. In this paper we propose a novel debugging approach allowing for interactive localization of bugs in non-ground programs. The new approach points the user directly to a set of non-ground rules involved in the bug, which might be refined (up to the point in which the bug is easily identified) by asking the programmer a sequence of questions on an expected answer set. The approach has been implemented on top of the ASP solver WASP. The resulting debugger has been complemented by a user-friendly graphical interface, and integrated in ASPI DE, a rich integrated development environment (IDE) for answer set programs. In addition, an empirical analysis shows that the new debugger is not affected by the grounding blowup limiting the application of previous approaches based on meta-programming.

关键词： answer set programming debugging graphical user interface

来源：评论

学校读者我要写书评

暂无评论

Optimizing Answer Set Computation via Heuristic-Based Decomposition

引用

theory and practice of logic programming 2019年第4期19卷 603-628页

作者： Calimeri, Francesco Perri, Simona Zangari, Jessica Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

Answer Set programming (ASP) is a purely declarative formalism developed in the field of logic programming and non-monotonic reasoning: computational problems are encoded by logic programs whose answer sets, corresponding to solutions, are computed by an ASP system. Different, semantically equivalent, programs can be defined for the same problem;however, performance of systems evaluating them might significantly vary. We propose an approach for automatically transforming an input logic program into an equivalent one that can be evaluated more efficiently. One can make use of existing tree-decomposition techniques for rewriting selected rules into a set of multiple ones;the idea is to guide and adaptively apply them on the basis of proper new heuristics, to obtain a smart rewriting algorithm to be integrated into an ASP system. The method is rather general: it can be adapted to any system and implement different preference policies. Furthermore, we define a set of new heuristics tailored at optimizing grounding, one of the main phases of the ASP computation;we use them in order to implement the approach into the ASP system DLV, in particular into its grounding subsystem I-DLV, and carry out an extensive experimental activity for assessing the impact of the proposal.

关键词： knowledge representation and nonmonotonic reasoning logic programming methodology and applications databases and semantic web reasoning Answer Set programming

来源：评论

学校读者我要写书评

暂无评论

Domain-Independent Cost-Optimal Planning in ASP

引用

theory and practice of logic programming 2019年第5-6期19卷 1124-1141页

作者： Spies, David You, Jia-Huai Hayward, Ryan Univ Alberta Edmonton AB Canada

We investigate the problem of cost-optimal planning in ASP. Current ASP planners can be trivially extended to a cost-optimal one by adding weak constraints, but only for a given makespan (number of steps). It is desirable to have a planner that guarantees global optimality. In this paper, we present two approaches to addressing this problem. First, we show how to engineer a cost-optimal planner composed of two ASP programs running in parallel. Using lessons learned from this, we then develop an entirely new approach to cost-optimal planning, stepless planning, which is completely free of makespan. Experiments to compare the two approaches with the only known cost-optimal planner in SAT reveal good potentials for stepless planning in ASP.

关键词： Cost-Optimal Planning Answer Set programming CORE-2 ASP Standard

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Approach for Security Hardening and Probabilistic Vulnerability Assessment on Attack Graphs

A Multi-Objective Approach for Security Hardening and Probab...

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Shuvo Bardhan Center for Security and Emerging Technology Georgetown University

ISBN: (数字)9781665488105

ISBN: (纸本)9781665488112

Assessing vulnerabilities of a network and mitigating them is a challenging task owing to the complexity and scale of the problem. Various probabilistic security metrics on attack graphs are presented in the literature to handle realistic attack scenarios involving large attack graphs. In our work, we propose a generalized path-enumeration based technique for computing attack probabilities on attack graphs that can handle repeated vulnerabilities as well as cyclic graphs. A multiplicative idempo-tency based approach is used for computation while aggregating the path probabilities. We employ the inclusion-exclusion principle to prove the soundness of our proposed technique. Also, in practice, we found that attackers retain experience and face reduced difficulty in exploiting a vulnerability in repeated attacks. In this paper, we extend the proposed probabilistic measure to incorporate such conditions leveraging possible decay functions. Our proposed metric is helpful in service management for network hardening. Network hardening is formulated as a multi-objective optimization problem that generates pareto-optimal solutions which trade off utility with vulnerability. Case studies are presented for complex attack graphs having interesting pareto-optimal solutions for service management.

关键词： Measurement Conferences Probabilistic logic Linear programming Software Complexity theory Security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：