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

From extended feature models to constraint logic programming

SCIENCE OF COMPUTER programming 2013年第12期78卷 2295-2312页

作者： Karatas, Ahmet Serkan Oguztuzun, Halit Dogru, Ali Middle E Tech Univ Dept Comp Engn TR-06531 Ankara Turkey

Since feature models for realistic product families may be quite complicated, the automated analysis of feature models is desirable. Although several approaches reported in the literature address this issue, complex cross-tree relationships involving attributes in extended feature models have not been handled. In this article, we introduce a mapping from extended feature models to constraint logic programming over finite domains. This mapping is used to translate into constraint logic programs;basic, cardinality-based and extended feature models, which can include complex cross-tree relationships involving attributes. This translation enables the use of off-the-shelf constraint solvers for the automated analysis of extended feature models involving such complex relationships. We also present the performance results of some well-known analysis operations on an example translated model. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Variability modeling Extended feature model Feature attribute constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A Flexible Framework to Ensure Traceability, Consistency, and Propagation of KPIs Evolution

引用

JOURNAL OF SOFTWARE-EVOLUTION AND PROCESS 2025年第2期37卷

作者： Dominguez, Eladio Perez, Beatriz Rubio, angel L. Zapata, Maria A. Univ Zaragoza Dept Informat & Ingn Sistemas Zaragoza Spain Univ La Rioja Dept Matemat & Comp La Rioja Spain

Organizations use key performance indicators (KPIs) to assess the effectiveness and efficiency of their procedures and processes. In a world that is constantly evolving and hyperconnected via the internet, it is of great interest to analyze how changes (organizational, legal, technological or other) can lead to modifications in the KPIs involved. However, little attention has been paid to KPI evolution either in the scientific literature or in developed solutions. This paper presents A Flexible Framework for the Evolution, Consistency and Traceability of KPIs (AFFECTK) that aims at establishing the basis for suitable KPIs' evolution management. The feasibility of this proposal is demonstrated through a proof-of-concept developed using a reasoning tool based on constraint logic programming. The framework is further evaluated, using real KPI case studies, to assess the functional suitability of our approach.

关键词： consistency conditions constraint logic programming evolution framework KPIs propagation reasoning traceability

来源：评论

学校读者我要写书评

暂无评论

A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals

引用

ACM TRANSACTIONS ON COMPUTATIONAL logic 2024年第1期25卷 1-34页

作者： Cristia, Maximiliano Rossi, Gianfranco Univ Nacl Rosario Fac Ciencias Exactas Ingn & Agrimensura Pellegrini 250 RA-2000 Rosario Santa Fe Argentina CIFASIS Fac Ciencias Exactas Ingn & Agrimensura Pellegrini 250 RA-2000 Rosario Santa Fe Argentina Univ Parma Dipartimento Sci Matemat Fis & Informat Parco Area Sci53-A I-43124 Parma Italy

In this paper we extend a decision procedure for the Boolean algebra of finite sets with cardinality constraints (L-vertical bar center dot vertical bar) to a decision procedure for L-vertical bar center dot vertical bar extended with set terms denoting finite integer intervals (L-[]). In L-[] interval limits can be integer linear terms including unbounded variables. These intervals are a useful extension because they allow to express non-trivial set operators such as the minimum and maximum of a set, still in a quantifier-free logic. Hence, by providing a decision procedure for L-[] it is possible to automatically reason about a new class of quantifier-free formulas. The decision procedure is implemented as part of the {log} ('setlog') tool. The paper includes a case study based on the elevator algorithm showing that {log} can automatically discharge all its invariance lemmas, some of which involve intervals.

关键词： {log} set theory integer intervals decision procedure constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A Practical Decision Procedure for Quantifier-Free, Decidable Languages Extended with Restricted Quantifiers

引用

JOURNAL OF AUTOMATED REASONING 2024年第4期68卷 23页

作者： Cristia, Maximiliano Rossi, Gianfranco Univ Nacl Rosario Rosario Argentina UNR CIFASIS CONICET Rosario Argentina Univ Parma Parma Italy

Let L(X )be the language of a first-order, decidable, quantifier-free theory X. Consider the language, L-RQ(X), that extends L-X with formulas of the form for all x is an element of A : phi (restricted universal quantifier, RUQ) and there exists x is an element of A : phi(restricted existential quantifier, REQ), where A is a finite set and phi is a formula made of X-formulas, RUQ and REQ. That is,L-RQ(X)admits nested restricted quantifiers. In this paper we present a decision procedure for some expressive fragments of L-RQ(X) and its implementation as part of the{log}('setlog') tool. The usefulness of the approach is shown by reporting on three real-world case studies.

关键词： Restricted quantifiers Set theory constraint logic programming {log}

来源：评论

学校读者我要写书评

暂无评论

Combining Type Checking and Set constraint Solving to Improve Automated Software Verification

引用

THEORY AND PRACTICE OF logic programming 2024年第5期24卷 1011-1030页

作者： Cristia, Maximiliano Rossi, Gianfranco Univ Nacl Rosario Rosario Argentina CIFASIS CONICET UNR Rosario Argentina Univ Parma Parma Italy

This technical note shows how we have combined prescriptive type checking and constraint solving to increase automation during software verification. We do so by defining a type system and implementing a typechecker for {log} (read 'setlog'), a constraint logic programming language and satisfiability solver based on set theory. The constraint solver is proved to be safe w.r.t. the type system. Two industrial-strength case studies are presented where this combination is used with very good results.

关键词： {log} set theory constraint logic programming type system typechecker

来源：评论

学校读者我要写书评

暂无评论

Modular Primal-Dual Fixpoint logic Solving for Temporal Verification

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2023年第POPL期7卷 2111-2140页

作者： Unno, Hiroshi Terauchi, Tachio Gu, Yu Koskinen, Eric Univ Tsukuba Tsukuba Ibaraki Japan RIKEN AIP Tokyo Japan Waseda Univ Tokyo Japan Stevens Inst Technol Hoboken NJ 07030 USA

We present a novel approach to deciding the validity of formulas in first-order fixpoint logic with background theories and arbitrarily nested inductive and co-inductive predicates defining least and greatest fixpoints. Our approach is constraint-based, and reduces the validity checking problem of the given first-order-fixpoint logic formula (formally, an instance in a language called mu CLP) to a constraint satisfaction problem for a recently introduced predicate constraint language. Coupled with an existing sound-and-relatively-complete solver for the constraint language, this novel reduction alone already gives a sound and relatively complete method for deciding mu CLP validity, but we further improve it to a novel modular primal-dual method. The key observations are (1) mu CLP is closed under complement such that each (co-)inductive predicate in the original primal instance has a corresponding (co-)inductive predicate representing its complement in the dual instance obtained by taking the standard De Morgans dual of the primal instance, and (2) partial solutions for (co-)inductive predicates synthesized during the constraint solving process of the primal side can be used as sound upper-bounds of the corresponding (co-)inductive predicates in the dual side, and vice versa. By solving the primal and dual problems in parallel and exchanging each others partial solutions as sound bounds, the two processes mutually reduce each others solution spaces, thus enabling rapid convergence. The approach is also modular in that the bounds are synthesized and exchanged at granularity of individual (co-)inductive predicates. We demonstrate the utility of our novel fixpoint logic solving by encoding a wide variety of temporal verification problems in mu CLP, including termination/non-termination, LTL, CTL, and even the full modal mu-calculus model checking of infinite state programs. The encodings exploit the modularity in both the program and the property by expressing each loo

关键词： temporal verification fixpoint logics constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A constraint-Based Mathematical Modeling Library in Prolog with Answer constraint Semantics 17th

A Constraint-Based Mathematical Modeling Library in Prolog w...

引用

17th International Symposium on Functional and logic programming (FLOPS)

作者： Fages, Francois Inria Saclay Palaiseau France

ISBN: (纸本)9789819722990;9789819723003

constraint logic programming emerged in the late 80's as a highly declarative class of programming languages based on first-order logic and theories with decidable constraint languages, thereby subsuming Prolog restricted to equality constraints over the Herbrand's term domain. This approach has proven extremely successful in solving combinatorial problems in the industry which quickly led to the development of a variety of constraint solving libraries in standard programming languages. Later came the design of a purely declarative front-end constraint-based modeling language, MiniZinc, independent of the constraint solvers, in order to compare their performances and create model benchmarks. Beyond that purpose, the use of a high-level modeling language such as MiniZinc to develop complete applications, or to teach constraint programming, is limited by the impossibility to program search strategies, or new constraint solvers, in a modeling language, as well as by the absence of an integrated development environment for both levels of constraint-based modeling and constraint solving. In this paper, we propose to solve those issues by taking Prolog with its constraint solving libraries, as a unified relation-based modeling and programming language. We present a Prolog library for high-level constraint-based mathematical modeling, inspired by MiniZinc, using subscripted variables (arrays) in addition to lists and terms, quantifiers and iterators in addition to recursion, together with a patch of constraint libraries in order to allow array functional notations in constraints. We show that this approach does not come with a significant computation time overhead, and presents several advantages in terms of the possibility of focussing on mathematical modeling, getting answer constraints in addition to ground solutions, programming search or constraint solvers if needed, and debugging models within a unique modeling and programming environment.

关键词： constraint logic programming algebraic modeling languages answer constraints MiniZinc meta-predicates constraint solving constraint simplification attributed variables ISO-Prolog

来源：评论

学校读者我要写书评

暂无评论

Competition of Solvers for Constrained Horn Clauses (CHC-COMP 2023) 3rd

Competition of Solvers for Constrained Horn Clauses (CHC-COM...

引用

3rd International TOOLympics Challenge

作者： De Angelis, Emanuele Krishnan, Hari Govind Vediramana CNR IASI Rome Italy Univ Waterloo Waterloo ON Canada

ISBN: (纸本)9783031676949;9783031676956

Constrained Horn Clauses (CHC) are a fragment of first-order logic that is expressive enough to represent many important software verification tasks, yet practical for fully automatic techniques. CHCs are used to verify the safety of hardware, software, and hybrid systems, infer refinement types, analyse program termination, and prove the correctness of smart contracts, among other applications. Over the years, many researchers have developed a variety of tools to check the satisfiability of CHCs. CHC-COMP strives to bring together these research efforts and compare the effectiveness of different CHC solvers on a unified set of benchmarks. Each year, CHC-COMP collects benchmarks provided by the CHC community, organizes them into tracks, and evaluates CHC solvers against those tracks. This annual competition is now in its sixth year. This report gives an overview of CHC-COMP and details of its sixth edition.

关键词： Constrained Horn Clauses constraint logic programming Satisfiability Modulo Theories constraint Solving

来源：评论

学校读者我要写书评

暂无评论

Proactive and reactive approach to employee competence configuration problem in planning and scheduling processes

引用

APPLIED INTELLIGENCE 2022年第3期52卷 3445-3464页

作者： Wikarek, Jaroslaw Sitek, Pawel Kielce Univ Technol Kielce Poland

At the time of commonplace automation, robotization and the rapid development of IT, high qualifications of employees have become the critical element of every industry system. This follows from their limited availability, frequently high costs of procurement and possible employee absenteeism. Moreover, the concept of Industry 4.0 will transform current industry employees into knowledge employees. This is due to the fact that hard and routine tasks will be executed by robots and computers. This constitutes change in the required employee competences. Unfortunately, the aspect of management and configuration of employee competences is often overlooked in industrial practice. In response to the existing problem, the article puts forward the original model of employee competence configuration which is a basis for responses to numerous questions of managers of production processes, both general ones, e.g., Do we have a sufficient set of competences to execute a production schedule? as well as detailed ones, e.g., Which and how many competences are missing? etc. An important novelty of the presented model is the possibility of its application with both proactive and reactive questions. Due to the discrete and combinatorial nature of the problem under consideration, the use of mathematical programming methods was limited only to small data instances. Therefore, a proprietary dedicated genetic algorithm was proposed to solve this problem, which turned out to be extremely effective. The use of this genetic algorithm has enabled finding a solution depending on the instance data up to 70 times faster than by use of the mathematical programming.

关键词： Proactive and reactive approach Scheduling Resource allocation Genetic algorithms constraint logic programming Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Analysis and Transformation of Constrained Horn Clauses for Program Verification

引用

THEORY AND PRACTICE OF logic programming 2022年第6期22卷 974-1042页

作者： De Angelis, Emanuele Fioravanti, Fabio Gallagher, John P. Hermenegildo, Manuel, V Pettorossi, Alberto Proietti, Maurizio IASI CNR Rome Italy Univ G DAnnunzio DEC Chieti Italy Roskilde Univ Roskilde Denmark IMDEA Software Inst Madrid Spain Univ Politecn Madrid UPM Madrid Spain Univ RomeTor Vergata DICII Rome Italy

This paper surveys recent work on applying analysis and transformation techniques that originate in the field of constraint logic programming (CLP) to the problem of verifying software systems. We present specialization-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn clauses (CHCs), a term that has become popular in the verification field to refer to CLP programs. Then, we describe static analysis techniques for CHCs that may be used for inferring relevant program properties, such as loop invariants. We also give an overview of some transformation techniques based on specialization and fold/unfold rules, which are useful for improving the effectiveness of CHC satisfiability tools. Finally, we discuss future developments in applying these techniques.

关键词： Program verification program analysis program transformation constrained Horn clauses constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：