Constraint Design Rewriting

We propose an algebraic approach to the design and transformation of constraint networks, inspired by Architectural Design Rewriting. The approach can be understood as (i) an extension of ADR with constraints, and (ii) an application of ADR to the design of reconfigurable constraint networks. The main idea is to consider classes of constraint networks as algebras whose operators are used to denote constraint networks with terms. Constraint network transformations such as constraint propagations are specified with rewrite rules exploiting the network’s structure provided by terms

Constraint design rewriting

Constraint networks are hyper-graphs whose nodes and hyper-edges represent variables and relations between them, respectively. The problem to assign values to variables by satisfying all constraints is NP-complete. We propose an algebraic approach to the design and transformation of constraint networks, inspired by Architectural Design Rewriting (ADR). The main idea is to exploit ADR to equip constraint networks with some hierarchical structure and represent them as terms of a suitable algebra, when possible. Constraint network transformations such as constraint propagations are then specified with efficient rewrite rules exploiting the network's structure provided by terms. The approach can be understood as (i) an extension of ADR with constraints, and (ii) an application of ADR to the design of reconfigurable constraint networks

Constraint design rewriting

Constraint networks are hyper-graphs whose nodes and hyper-edges represent variables and relations between them, respectively. The problem to assign values to variables by satisfying all constraints is NP-complete. We propose an algebraic approach to the design and transformation of constraint networks, inspired by Architectural Design Rewriting (ADR). The main idea is to exploit ADR to equip constraint networks with some hierarchical structure and represent them as terms of a suitable algebra, when possible. Constraint network transformations such as constraint propagations are then specified with efficient rewrite rules exploiting the network's structure provided by terms. The approach can be understood as (i) an extension of ADR with constraints, and (ii) an application of ADR to the design of reconfigurable constraint networks

C3S2E-2008-2016-FinalPrograms

This document records the final programs for each of the 9 meetings of the C* Conference on Computer Science & Software Engineering, C 3S2E which were organized in various locations on three continents. The papers published during these years are accessible from the digital librariy of ACM(2008-2016

Soft constraints for KnowLang

Constraints are widely used in information technologies and research elds such as programming languages, arti cial in- telligence, databases, information security, web technologies, etc. In this paper, we present our preliminary steps of using soft constraints for knowledge representation. We integrate soft constraints in KnowLang, a formal language for knowl- edge representation in self-adaptive systems. KnowLang al- lows for e cient and comprehensive knowledge structuring where ontologies are integrated with rules and Bayesian net- works. The approach targets at a technique where knowl- edge can be represented as special restrictive rules that may require full or partial satisfaction, i.e., restrictions are rep- resented as some sort of good-to-have properties