Search results

Items from 1 to 20 out of 171 results

article

Dischargeable Obligations in the SCIFF Framework

Marco Alberti, Marco Gavanelli, Evelina Lamma, Fabrizio Riguzzi, more

Fundamenta Informaticae > 2020 > Vol. 176, nr 3/4 > 321--348

Abductive Logic Programming (ALP) has been proven very effective for formalizing societies of agents, commitments and norms, in particular by mapping the most common deontic operators (obligation, prohibition, permission) to abductive expectations. In our previous works, we have shown that ALP is a suitable framework for representing norms. Normative reasoning and query answering were accommodated...

article

Selective Unification in (Constraint) Logic Programming

Fred Mesnard, Étienne Payet, Germán Vidal

Fundamenta Informaticae > 2020 > Vol. 177, nr 3/4 > 359--383

Concolic testing is a well-known validation technique for imperative and object oriented programs. In a previous paper, we have introduced an adaptation of this technique to logic programming. At the heart of our framework lies a specific procedure that we call “selective unification”. It is used to generate appropriate run-time goals by considering all possible ways an atom can unify with the heads...

article

Constraint Logic Programming with Polynomial Constraints over Finite Domains

F. Bergenti, S. Monica, G. Rossi

Fundamenta Informaticae > 2018 > Vol. 161, nr 1/2 > 9--27

This paper introduces an instantiation of the constraint logic programming scheme called CLP(PolyFD) in which variables take values from finite subsets of the integers and constraints are expressed as equalities, inequalities, and disequalities of polynomials with integer coefficients. Such constraints, which we call polynomial constraints over finite domains, can be treated effectively by means of...

article

A multi-level approach to ubiquitous modeling and solving constraints in combinatorial optimization problems in production and distribution

Paweł Sitek, Jarosław Wikarek

Applied Intelligence > 2018 > 48 > 5 > 1344-1367

Constraints, although ubiquitous in production and distribution planning, scheduling and control, often lead to inconsistencies in the decision-making process. The constraint-based modeling helps circumvent many organization-impacting issues. To address this, we developed a multi-level approach to the modeling and solving of combinatorial optimization problems. It is versatile and effective owing...

article

Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach

Pawel Sitek, Jarosław Wikarek

Annals of Operations Research > 2019 > 273 > 1-2 > 257-277

The paper presents an optimization model and its implementation using a hybrid approach for the Capacitated Vehicle Routing Problem with Pick-up and Alternative Delivery (CVRPPAD). The development of the CVRPPAD was motivated by postal items distribution issues. The model proposed combines various features of Vehicle Routing Problem variants. The novelty of this model lies in the introduction of alternativeness...

chapter

Autonomous generation of conflict-free examination timetable using constraint satisfaction modelling

Tarek Elsaka

2017 International Artificial Intelligence and Data Processing Symposium (IDAP) > 1 - 10

2017 International Artificial Intelligence and Data Processing Symposium (IDAP)

Examination timetable (ETT) is a complex administrative task at educational institutions that must fulfill various constraints to generate the ETT to schedule exam sessions within a precise period. The ETT problem could be modeled as Constraint Satisfaction Problems (CSPs). In addition, it could be particularly investigated by Constraint Logic Programming (CLP) approach. This paper uses a real examination...

article

Program Verification using Constraint Handling Rules and Array Constraint Generalizations

E. De Angelis, F. Fioravanti, A. Pettorossi, M. Proietti

Fundamenta Informaticae > 2017 > Vol. 150, nr 1 > 73--117

The transformation of constraint logic programs (CLP programs) has been shown to be an effective methodology for verifying properties of imperative programs. By following this methodology, we encode the negation of a partial correctness property of an imperative program prog as a predicate incorrect defined by a CLP program T, and we show that prog is correct by transforming T into the empty program...

chapter

Automated Test Generation for Synchronous Controllers

Mouna Tka Mnad, Christophe Deleuze, Ioannis Parissis, Jackie Launay, more

2016 IEEE/ACM 11th International Workshop in Automation of Software Test (AST) > 1 - 7

2016 IEEE/ACM 11th International Workshop in Automation of Software Test (AST)

This paper addresses the problem of automating the produc-tion of test sequences for a particular class of ProgrammableLogic Controllers (em4) produced by InnoVista Sensors.The latter are synchronous systems and are programmedby means of an ad hoc integrated development environment(IDE). People using and programming such controllers arenot necessarily experienced programmers, so the develop-ment of...

article

Declarative Representation and Solution of Vehicle Routing with Pickup and Delivery Problem

Amelia Bădică, Costin Bădică, Florin Leon, Lucian Luncean

Procedia Computer Science > 2017 > 108 > C > 958-967

Recently we have proposed a multi-agent system that provides an intelligent logistics brokerage service focusing on the transport activity for the efficient allocation of transport resources (vehicles or trucks) to the transport applications. The freight broker agent has a major role to coordinate transportation arrangements of transport customers (usually shippers and consignees) with transport resource...

chapter

Constraint-Based Test Case Generation for White-Box Method-Level Unit Testing

Cheng-Hung Chang, Nai-Wei Lin

2016 International Computer Symposium (ICS) > 601 - 604

2016 International Computer Symposium (ICS)

This paper introduces a unified constraint-based test case generator for white-box method-level unit testing. The derivation of a suite of test cases can be defined as a constraint satisfaction problem. Each test case consists of a test input and an expected output. The program is automatically transformed into a constraint model called constraint logic graph. The constraint logic graph is a succinct...

chapter

Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers

Gerrit Färber, Said Salhi, Anna M. Coves Moreno

Lecture Notes in Computer Science > Large-Scale Scientific Computing > Application of Metaheuristics to Large-Scale Problems > 536-544

This work presents the performance comparison of two conceptually different approaches for a mixed model non-permutation flowshop production line. The demand is a semi-dynamic demand with a fixed job sequence for the first station. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the number of available...

chapter

Analysis of Imperative Programs through Analysis of Constraint Logic Programs

Julio C. Peralta, John P. Gallagher, Hüseyin Sağlam

Lecture Notes in Computer Science > Static Analysis > Partial Evaluation > 246-261

In this paper a method is proposed for carrying out analysis of imperative programs. We achieve this by writing down the language semantics as a declarative program (a constraint logic program, in the approach shown here). We propose an effective style of writing operational semantics suitable for analysis which we call one-state small-step semantics. Through controlled partial evaluation we are able...

chapter

A Declarative Framework for Constrained Search Problems

Paweł Sitek, Jarosław Wikarek

Lecture Notes in Computer Science > New Frontiers in Applied Artificial Intelligence > Special Session: Knowledge Driven Manufacturing Systems > 728-737

Constrained search problems (eg. scheduling, planning, resource allocation, placement, routing etc.) appear frequently at different levels of decisions. They are usually characterized by many types of constraints, which make them unstructured and difficult to solve (NP-complete). Traditional mathematical programming approaches are deficient because their representation of constraints is artificial...

article

Portfolio selection of new product projects: a product reliability perspective

M. Relich

Eksploatacja i Niezawodność > 2016 > Vol. 18, no. 4 > 613--620

Portfolio selection of new product development projects is one of the most important decisions in an enterprise that impact future business profits, competitiveness and survival. Ensuring reliability in a new product is costly but it increases customer satisfaction and reduces the potential warranty cost, contributing to product success. This paper aims to develop an approach for designing decision...

chapter

Formal Understanding of Tradeoffs among Liveness and Safety Requirements

Ozgur Kafali, Nirav Ajmeri, Munindar P. Singh

2016 IEEE 24th International Requirements Engineering Conference Workshops (REW) > 17 - 18

2016 IEEE 24th International Requirements Engineering Conference Workshops (REW)

Understanding tradeoffs among stakeholder requirements regarding liveness (something good happens) and safety (nothing bad happens) is crucial for designing sociotechnical systems (STSs). Safety-focused specifications restrict agents' actions to avoid undesired executions. However, such restrictions hinder liveness. We formalize such tradeoffs using the elements of an STS specification to understand...

chapter

Using Expert Systems to Statically Detect "Dynamic" Conflicts in XACML

Bernard Stepien, Amy Felty

2016 11th International Conference on Availability, Reliability and Security (ARES) > 127 - 136

2016 11th International Conference on Availability, Reliability and Security (ARES )

Policy specification languages such as XACML often provide mechanisms to resolve dynamic conflicts that occur when trying to determine if a request should be permitted or denied access by a policy. Examples include "deny-overrides" or "first-applicable." Such algorithms are primitive and potentially a risk for corporate computer security. While they can be useful for resolving...

chapter

Mapping Extended Feature Models to Constraint Logic Programming over Finite Domains

Ahmet Serkan Karataş, Halit Oğuztüzün, Ali Doğru

Lecture Notes in Computer Science > Software Product Lines: Going Beyond > Feature Modeling > 286-299

As feature models for realistic product families may be quite complicated, automated analysis of feature models is desirable. Although several approaches reported in the literature addressed this issue, complex feature-attribute and attribute-attribute relationships in extended feature models were not handled effectively. In this article, we introduce a mapping from extended feature models to constraint...

chapter

Implementing a finite-domain CLP-language on top of Prolog: a transformational approach

Henk Vandecasteele, Danny Schreye

Lecture Notes in Computer Science > Logic Programming and Automated Reasoning > 84-98

chapter

An informal introduction to constraint database systems (extended abstract)

Volker Gaede, Mark Wallace

Lecture Notes in Computer Science > Constraint Databases and Applications > 7-52

In this paper, we provide an informal introduction to constraint database systems, a new database paradigm which has significant advantages over other database models such as the object-oriented and relational one. In fact, constraint database systems can integrate the most prominent features of other models within a single framework based on constraints while overcoming some of their problems. We...

chapter

Efficient Negation Using Abstract Interpretation

Susana Muñoz, Juan José Moreno, Manuel Hermenegildo

Lecture Notes in Computer Science > Logic for Programming, Artificial Intelligence, and Reasoning > Experimental Papers > 485-494

While negation has been a very active area of research in logic programming, comparatively few papers have been devoted to implementation issues. Furthermore, the negation-related capabilities of current Prolog systems are limited. We recently presented a novel method for incorporating negation in a Prolog compiler which takes a number of existing methods (some modified and improved by us) and uses...

Publication date

Set your own date range

Content availability

Available (145)
None (26)

Publication type

article (104)
book (67)

INFONA - science communication portal

Search results

Dischargeable Obligations in the SCIFF Framework

Selective Unification in (Constraint) Logic Programming

Constraint Logic Programming with Polynomial Constraints over Finite Domains

A multi-level approach to ubiquitous modeling and solving constraints in combinatorial optimization problems in production and distribution

Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach

Autonomous generation of conflict-free examination timetable using constraint satisfaction modelling

Program Verification using Constraint Handling Rules and Array Constraint Generalizations

Automated Test Generation for Synchronous Controllers

Declarative Representation and Solution of Vehicle Routing with Pickup and Delivery Problem

Constraint-Based Test Case Generation for White-Box Method-Level Unit Testing

Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers

Analysis of Imperative Programs through Analysis of Constraint Logic Programs

A Declarative Framework for Constrained Search Problems

Portfolio selection of new product projects: a product reliability perspective

Formal Understanding of Tradeoffs among Liveness and Safety Requirements

Using Expert Systems to Statically Detect "Dynamic" Conflicts in XACML

Mapping Extended Feature Models to Constraint Logic Programming over Finite Domains

Implementing a finite-domain CLP-language on top of Prolog: a transformational approach

An informal introduction to constraint database systems (extended abstract)

Efficient Negation Using Abstract Interpretation

Filter options

Publication date

Content availability

Publication type

Publication language

Keywords

Data set

INFONA - science communication portal

Search results

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Content availability

Publication type

Publication language

Keywords

Data set

Reporting an error / abuse

Sending the report failed

Accessibility options