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

16th International Conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Boehl, Elisa Gaggl, Sarah Alice Tech Univ Dresden Log Programming & Argumentat Grp Dresden Germany

ISBN: (纸本)9783031157073;9783031157066

Answer set programming (ASP) solvers have advanced in recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process, the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets one after another by iteratively solving and updating the program. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.

关键词： multi-shot answer set programming navigation diverse answer sets

来源：评论

学校读者我要写书评

暂无评论

State Transition in Multi-agent Epistemic Domains Using Answer Set programming 16th

State Transition in Multi-agent Epistemic Domains Using Answ...

引用

16th International Conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Izmirlioglu, Yusuf Pham, Loc Son, Tran Cao Pontelli, Enrico New Mexico State Univ Las Cruces NM 88003 USA

ISBN: (纸本)9783031157073;9783031157066

In this paper we develop a state transition function for partially observable multi-agent epistemic domains and implement it using Answer Set programming (ASP). The transition function computes the next state upon an occurrence of a single action. Thus it can be used as a module in epistemic planners. Our transition function incorporates ontic, sensing and announcement actions and allows for arbitrary nested belief formulae and general common knowledge. A novel feature of our model is that upon an action occurrence, an observing agent corrects his (possibly wrong) initial beliefs about action precondition and his observability. By examples, we show that this step is necessary for robust state transition. We establish some properties of our state transition function regarding its soundness in updating beliefs of agents consistent with their observability.

关键词： Answer Set programming Multi-agent systems Epistemic planning State transition

来源：评论

学校读者我要写书评

暂无评论

Finding Real Bugs in Big Programs with Incorrectness logic

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2022年第OOPSLA期6卷 1–27页

作者： Quang Loc Le Raad, Azalea Villard, Jules Berdine, Josh Dreyer, Derek O'Hearn, Peter W. UCL London England Meta London England MPI SWS Saarland Informat Campus Saarbrucken Germany

Incorrectness logic (IL) has recently been advanced as a logical theory for compositionally proving the presence of bugs-dual to Hoare logic, which is used to compositionally prove their absence. Though IL was motivated in large part by the aim of providing a logical foundation for bug-catching program analyses, it has remained an open question: is IL useful only retrospectively (to explain existing analyses), or can it actually be useful in developing new analyses which can catch real bugs in big programs? In this work, we develop Pulse-X, a new, automatic program analysis for catching memory errors, based on ISL, a recent synthesis of IL and separation logic. Using Pulse-X, we have found 15 new real bugs in OpenSSL, which we have reported to OpenSSL maintainers and have since been fixed. In order not to be overwhelmed with potential but false error reports, we develop a compositional bug-reporting criterion based on a distinction between latent and manifest errors, which references the under-approximate ISL abstractions computed by Pulse-X, and we investigate the fix rate resulting from application of this criterion. Finally, to probe the potential practicality of our bug-finding method, we conduct a comparison to Infer, a widely used analyzer which has proven useful in industrial engineering practice.

关键词： bug catching incorrectness proving incorrectness logic compositionality

来源：评论

学校读者我要写书评

暂无评论

Introduction to the Special Issue on logic Rules and Reasoning: Selected Papers from the 2nd International Joint Conference on Rules and Reasoning (RuleML+RR 2018)

引用

theory and practice of logic programming 2021年第1期21卷 1-3页

作者： Benzmueller, Christoph Parent, Xavier Ricca, Francesco Free Univ Berlin Dept Math & Comp Sci Berlin Germany Univ Luxembourg Dept Comp Sci Esch Sur Alzette Luxembourg Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

来源：评论

学校读者我要写书评

暂无评论

Representing Abstract Dialectical Frameworks with Binary Decision Diagrams 16th

Representing Abstract Dialectical Frameworks with Binary Dec...

引用

16th International Conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Ellmauthaler, Stefan Gaggl, Sarah Alice Rusovac, Dominik Wallner, Johannes P. Tech Univ Dresden Cfaed Knowledge Based Syst Grp Dresden Germany Tech Univ Dresden Log Programming & Argumentat Grp Dresden Germany Graz Univ Technol Inst Software Technol Graz Austria

ISBN: (纸本)9783031157073;9783031157066

A Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (RoBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by RoBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics for search space exploitation, based on easily retrievable properties of RoBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.

关键词： Abstract dialectical frameworks Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

In Praise of Impredicativity: A Contribution to the Formalization of Meta-programming

引用

theory and practice of logic programming 2020年第1期20卷 99-146页

作者： Bry, Francois Ludwig Maximilian Univ Munich Inst Informat Munich Germany

Processing programs as data is one of the successes of functional and logic programming. Higher-order functions, as program-processing programs are called in functional programming, and meta-programs, as they are called in logic programming, are widespread declarative programming techniques. In logic programming, there is a gap between the meta-programming practice and its theory: The formalizations of meta-programming do not explicitly address its impredicativity and are not fully adequate. This article aims at overcoming this unsatisfactory situation by discussing the relevance of impredicativity to meta-programming, by revisiting former formalizations of meta-programming, and by defining Reflective Predicate logic, a conservative extension of first-order logic, which provides a simple formalization of meta-programming.

关键词： logic programming meta-programming model theory Barber Paradox Russell's Paradox reflection

来源：评论

学校读者我要写书评

暂无评论

The FPGA programming Handbook: An essential guide to FPGA design for transforming ideas into hardware using SystemVerilog and VHDL

引用

2024年

作者： Frank Bruno Guy Eschemann

Develop solid FPGA programming skills in SystemVerilog and VHDL by crafting practical projects – VGA controller, microprocessor, calculator, keyboard – and amplify your know-how with insider industry knowledge, all ...

ISBN: (数字)9781805121206

Key Features

Explore a wide range of FPGA applications, grasp their versatility, and master Xilinx FPGA tool flow
Master the intricacies of SystemVerilog and VHDL to develop robust and efficient hardware circuits
Refine skills with CPU, VGA, and calculator projects for practical expertise in real-world applications

Book Description

In today"s tech-driven world, Field Programmable Gate Arrays (FPGAs) are foundation of many modern systems. Transforming ideas into reality demands a deep dive into FPGA architecture, tools, and design principles. This FPGA book is your essential companion to FPGA development with SystemVerilog and VHDL, tailored for both beginners and those looking to expand their knowledge. In this edition, you will gain versatility in FPGA design, opening doors to diverse opportunities and projects in the field. Go beyond theory with structured, hands-on projects, starting from simple LED control and progressing to advanced microcontroller applications, highly sought after in today"s FPGA job market. You will go from basic Boolean logic circuits to a resource-optimized calculator, showcasing your hardware design prowess. Elevate your knowledge by designing a VGA controller, demonstrating your ability to synthesize complex hardware systems. Use this handbook as your FPGA development guide, mastering intricacies, igniting creativity, and emerging with the expertise to craft hardware circuits using SystemVerilog and VHDL. This isn"t just another technical manual; it"s your exhilarating journey to master both theory and practice, accelerating your FPGA design skills to soaring new heights. Grab your copy today

关键词：

来源：评论

学校读者我要写书评

暂无评论

26th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2023, held as part of the 26th European Joint Conferences on theory and practice of Software, ETAPS 2023

26th International Conference on Foundations of Software Sci...

引用

26th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2023, held as part of the 26th European Joint Conferences on theory and practice of Software, ETAPS 2023

ISBN: (纸本)9783031308284

The proceedings contain 26 papers. The special focus in this conference is on Foundations of Software Science and Computational Structures. The topics include: Coverability in 2-VASS with One Unary Counter is in NP;on History-Deterministic One-Counter Nets;unboundedness Problems for Machines with Reversal-Bounded Counters;reverse Bisimilarity vs. Forward Bisimilarity;explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains;weighted and Branching Bisimilarities from Generalized Open Maps;preservation and Reflection of Bisimilarity via Invertible Steps;quantitative Safety and Liveness;on the Comparison of Discounted-Sum Automata with Multiple Discount Factors;fast Matching of Regular Patterns with Synchronizing Counting;deciding Contextual Equivalence of ν -Calculus with Effectful Contexts;compositional Learning for Interleaving Parallel Automata;pebble minimization: the last theorems;fixed Points and Noetherian Topologies;an Efficient Cyclic Entailment Procedure in a Fragment of Separation logic;just Testing;model and Program Repair via Group Actions;subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives;kantorovich Functors and Characteristic logics for Behavioural Distances;a logical Framework with Higher-Order Rational (Circular) Terms;a Higher-Order Language for Markov Kernels and Linear Operators;a Formal logic for Formal Category theory;a Strict Constrained Superposition Calculus for Graphs;a programming Language Characterizing Quantum Polynomial Time;on the Existential Arithmetics with Addition and Bitwise Minimum.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling

引用

theory and practice of logic programming 2022年第4期22卷 623-639页

作者： El-Kholany, Mohammed M. S. Gebser, Martin Schekotihin, Konstantin Univ Klagenfurt Klagenfurt Austria Cairo Univ Cairo Egypt Graz Univ Technol Graz Austria

Scheduling methods are important for effective production and logistics management, where tasks need to be allocated and performed with limited resources. In particular, the Job-shop Scheduling Problem (JSP) is a well known and challenging combinatorial optimization problem in which tasks sharing a machine are to be arranged in a sequence such that encompassing jobs can be completed as early as possible. Given that already moderately sized JSP instances can be highly combinatorial, and neither optimal schedules nor the runtime to termination of complete optimization methods is known, efficient approaches to approximate good-quality schedules are of interest. In this paper, we propose problem decomposition into time windows whose operations can be successively scheduled and optimized by means of multi-shot Answer Set programming (ASP) solving. From a computational perspective, decomposition aims to split highly complex scheduling tasks into better manageable subproblems with a balanced number of operations so that good-quality or even optimal partial solutions can be reliably found in a small fraction of runtime. Regarding the feasibility and quality of solutions, problem decomposition must respect the precedence of operations within their jobs and partial schedules optimized by time windows should yield better global solutions than obtainable in similar runtime on the entire instance. We devise and investigate a variety of decomposition strategies in terms of the number and size of time windows as well as heuristics for choosing their operations. Moreover, we incorporate time window overlapping and compression techniques into the iterative scheduling process to counteract window-wise optimization limitations restricted to partial schedules. Our experiments on JSP benchmark sets of several sizes show that successive optimization by multi-shot ASP solving leads to substantially better schedules within the runtime limit than global optimization on the full problem, whe

关键词： job-shop scheduling problem answer set programming problem decomposition

来源：评论

学校读者我要写书评

暂无评论

Optimising Business Process Discovery Using Answer Set programming 16th

Optimising Business Process Discovery Using Answer Set Progr...

引用

16th International Conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Chesani, Federico Di Francescomarino, Chiara Ghidini, Chiara Grundler, Giulia Loreti, Daniela Maggi, Fabrizio Maria Mello, Paola Montali, Marco Tessaris, Sergio DISI Univ Bologna Bologna Italy Fdn Bruno Kessler Trento Italy Free Univ Bozen Bolzano Bolzano Italy

ISBN: (纸本)9783031157073;9783031157066

Declarative business process discovery aims at identifying sets of constraints, from a given formal language, that characterise a workflow by using pre-recorded activity logs. Since the provided logs represent a fraction of all the consistent evolution of a process, and the fact that many sets of constraints covering those examples can be selected, empirical criteria should be employed to identify the "best" candidates. In our work we frame the process discovery as an optimisation problem, where we want to identify optimal sets of constraints according to preference criteria. Declarative constraints for processes are usually characterised via temporal logics, so different solutions can be semantically equivalent. For this reason, it is difficult to use an arbitrary finite domain constraints solvers for the optimisation. The use of Answer Set programming enables the combination of deduction rules within the optimisation algorithm, in order to take into account not only the user preferences but also the implicit semantics of the formal language. In this paper we show how we encoded the process discovery problem using the ASPrin framework for qualitative and quantitative optimisation in ASP, and the results of our experiments.

关键词： Preferences Answer set programming Optimisation Process mining Process discovery Declarative process models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

Key Features

Book Description

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

Key Features

Book Description

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：