Výsledky vyhledávání - "soft constraint satisfaction"

Soft constraint abstraction based on semiring homomorphism

Autor: Mingsheng Ying, Sanjiang Li

Publikováno v: Theoretical Computer Science. 403(2-3):192-201

The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi \cite{BMR97}, is a very general framework of soft constraints. In this paper we propose an abstraction scheme for soft constraints that u

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3210878f46bd294ff68e53ce1c071314

Zobrazit plný text záznamu

Many-valued institutions for constraint specification

Autor: Fernando Orejas, José Luiz Fiadeiro, Claudia Elena Chiriźăź

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Fundamental Approaches to Software Engineering ISBN: 9783662496640
FASE
Recercat. Dipósit de la Recerca de Catalunya
instname

We advance a general technique for enriching logical systems with soft constraints, making them suitable for specifying complex software systems where parts are put together not just based on how they meet certain functional requirements but also on

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e94a3e8d20ef4520ac2f81b50612eb8
https://hdl.handle.net/2117/99926

Zobrazit plný text záznamu

Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction

Autor: Justin Yip, Arnaud Lallouet, Terrence W. K. Mak, Jimmy H. M. Lee

Publikováno v: Constraints
Constraints, Springer Verlag, 2015, 20 (2), pp.45. ⟨10.1007/s10601-014-9174-6⟩

International audience; The task at hand is that of a soft constraint problem with adversarial conditions. By amalgamating the weighted and quantified constraint satisfaction frameworks, a Minimax Weighted Constraint Satisfaction Problem (formerly Qu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1485443d2949ddad5bb90859f6bd434d
https://hal.archives-ouvertes.fr/hal-01145349

Zobrazit plný text záznamu

Kniha

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle

Autor: Arnaud Lallouet, Jimmy H. M. Lee, Terrence W. K. Mak

Publikováno v: Lecture Notes in Computer Science ISBN: 9783642335570
CP
Principles and Practice of Constraint Programming
Principles and Practice of Constraint Programming, Oct 2012, Quebec, Canada. pp.373-389

International audience; MinimaxWeighted Constraint Satisfaction Problems (formerly called QWCSPs) are a framework for modeling soft constrained problems with adversarial conditions. In this paper, we describe novel definitions and implementations of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bff9b764b7e7a37a9cc2af811a1aef0
https://doi.org/10.1007/978-3-642-33558-7_29

Zobrazit plný text záznamu

Finding partitions of arguments with Dung's properties via SCSPs

Autor: Paola Campli, Francesco Santini, Stefano Bistarelli

Publikováno v: ACM Symposium on Applied Computing (SAC 2011), pp. 913–919, TaiChung, Taiwan, 21-24 Mar, 2011
info:cnr-pdr/source/autori:Bistarelli S. [1], Campli P. [2], Santini F. [3]/congresso_nome:ACM Symposium on Applied Computing (SAC 2011)/congresso_luogo:TaiChung, Taiwan/congresso_data:21-24 Mar, 2011/anno:2011/pagina_da:913/pagina_a:919/intervallo_pagine:913–919
Scopus-Elsevier
BASE-Bielefeld Academic Search Engine
SAC

Forming coalition structures allows agents to join their forces with the aim to achieve a common task. We suggest it would be interesting to look for homogeneous groups which follow distinct lines of thought. For this reason, we extend the Dung Argum

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9b79aa90d0771b6382701aa6442492e
https://publications.cnr.it/doc/203677

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání