A compositional theory of constraint hierarchies (Operational semantics)

Jampel, Michael

doi:10.1007/3-540-61479-6_22

Cited by 4 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among these approaches two approaches are the most popular. A compositional theory for reasoning about over-constrained systems is an extension to constraint hierarchies permitting to consider compositionality and incrementality in constraint logic programming [8]. This theory defines a scheme for composing together solutions to individual hierarchies and shows that hierarchy composition can be expressed very simply using multisets.…”

Section: Csp Problem Solving Principlesmentioning

confidence: 99%

Comparison of non solvable problem solving principles issued from CSP and TRIZ

Dubois¹,

Rasovska²,

Guio³

The International Federation for Information Processing

View full text Add to dashboard Cite

Inventive problems from many domains are usually problems we are not able to solve. This problem insolvability is often due to the incomplete or unmatched representation model of the problem that does not correspond to the given problem. In this paper, we introduce two problem solving theories for the solutionless problems: Constraint Satisfaction Problem (CSP) and dialectical based methods and models (TRIZ). It is an exploratory analysis of both theories in order to compare grounding approach and tools of both theories. Their potential complementarities will be defined in further objective to improve problem solving strategy for the inventive problems by matching the CSP and TRIZ solving principles. We consider that it will contribute to better understanding of non-solvable problems, i.e. to improve representation models of the problems and to make the problem solving more accurately.

show abstract

Section: Csp Problem Solving Principlesmentioning

confidence: 99%