A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient recognition of finite satisfiability in UML class diagrams: Strengthening by propagation of disjoint constraints
2009
2009 International Conference on Model-Based Systems Engineering
Preserved Fulltext
This paper extends and strengthens our previous work on efficient recognition of finite satisfiability problems in UML class diagrams with constrained generalization sets. ...
The main contribution of the paper is a method for propagation of disjoint constraints within complex class hierarchy structures, which meaningfully extends the scope of the FiniteSat algorithm. ...
Efficient Decision of Finite Satisfiability in UML Class Diagrams In this section we describe the FiniteSat efficient algorithm for deciding finite satisfiability in UML class diagrams. ...
doi:10.1109/mbse.2009.5031714
fatcat:pqabpkjkgzcf5m4cawy3cgvefu
Stochastic Constraint Optimization using Propagation on Ordered Binary Decision Diagrams
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Earlier methods used Probabilistic Logic Programming (PLP) techniques to create Ordered Binary Decision Diagrams (OBDDs), which were decomposed into smaller constraints in order to exploit existing constraint ...
For the specific case of monotonic distributions, we suggest an alternative method for using CP in SCOP, based on the development of a new propagator; we show that this propagator is linear in the size ...
This research was supported by the Netherlands Organisation for Scientific Research (NWO). Behrouz Babaki is supported by a postdoctoral scholarship from IVADO. ...
arXiv:1807.01079v1
fatcat:yhdernn5g5aw7nkiwf6sfjnm2m
Improved Constraint Propagation via Lagrangian Decomposition
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We apply this approach to constraints that can be represented by decision diagrams, and show that propagating Lagrangian cost information can help improve the overall bound computation as well as the solution ...
Constraint propagation is inherently restricted to the local information that is available to each propagator. ...
We have shown how this approach can be utilized for stronger cost-based domain filtering, and that it leads to improved bounds for systems of alldiff constraints and set covering problems. ...
doi:10.1007/978-3-319-23219-5_3
fatcat:dfdzuvm2mbarjiz2narc77eik4
An Experimental Evaluation of Ground Decision Procedures
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
There is a large variety of algorithms for ground decision procedures, but their differences, in particular in terms of experimental performance, are not well studied. ...
We develop maps of the behavior of ground decision procedures by comparing the performance of a variety of technologies on benchmark suites with differing characteristics. ...
Better alternatives are to extend binary decision diagrams to include constraints instead of variables (e.g. difference decision diagrams), or to reduce the propositional constraint problem to a purely ...
doi:10.1007/978-3-540-27813-9_13
fatcat:vtodfjv6mrcknhl4vghsmdxvti
A Hybrid BDD and SAT Finite Domain Constraint Solver
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Finite-domain constraint solvers based on Binary Decision Diagrams (BDDs) are a powerful technique for solving constraint problems over finite set and integer variables represented as Boolean formulae. ...
of a finite-domain constraint problem. ...
We have previously shown how to represent many finite-domain constraint problems using Binary Decision Diagrams (BDDs) by modeling problems in terms of Boolean variables and representing both variable ...
doi:10.1007/11603023_8
fatcat:hyihg3ci4zf35mehqc667ugfsq
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we detect AMO and EO relations completely automatically and exploit them to improve SAT encodings that are based on Multi-Valued Decision Diagrams (MDDs). ...
Pseudo-Boolean (PB) constraints often have a critical role in constraint satisfaction and optimisation problems. ...
One of the best methods to encode PB constraints to SAT is to use Binary Decision Diagrams (BDDs) [13] . ...
doi:10.1007/978-3-030-30048-7_2
fatcat:vxndqomfzrbxxdcasnlql7eqnq
Finite satisfiability of UML class diagrams with constrained class hierarchy
2013
ACM Transactions on Software Engineering and Methodology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Second, a method for propagation of generalization-set constraints in a class diagram is introduced. ...
This article analyzes the problem of finite satisfiability of class diagrams with class hierarchy constraints and generalization-set constraints. ...
We thank Gera Weiss and Arnon Sturm for fruitful consultations, and the anonymous referees for their invaluable comments. ...
doi:10.1145/2491509.2491518
fatcat:lddfcn6w5nezbchhdtyuuokvz4
Decomposition Based on Decision Diagrams
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In recent years, decision diagrams (DDs) have proven useful for solving a variety of optimization problems, often closing long-standing instances from classical benchmarks. ...
This technique is applied to a special case of the independent set problem and to unconstrained binary quadratic programming. ...
Decision Diagrams for Binary Optimization For the purposes of this paper, we focus on solving binary optimization problems (BOPs), which are of the form max{f (x) : x ∈ S, x ∈ B n }, where n is the number ...
doi:10.1007/978-3-319-33954-2_4
fatcat:ikg4g6qxdnhkvfbyzg47lnasvq
Toupie=μ-calculus+constraints
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Toupie integrates a solver for systems of linear inequations over finite domains and uses an extension of Bryant's binary decision diagrams to encode relations. ...
Combination of/,-calculus expressiveness, efficient coding and manipulation of relations through the use of n-ary decision diagrams and constraint solving technics make Toupie a powerfull tool to perform ...
DDs versus BDDs Decision Diagrams : Decision Diagrams used in Toupie to encode relations are an extension for finite domains of the Bryant's Binary Decision Diagrams [4] . ...
doi:10.1007/3-540-60045-0_44
fatcat:fnkhwlymhfd43nun4hzefioay4
Smart Bound Selection for the Verification of UML/OCL Class Diagrams
2017
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Correctness of UML class diagrams annotated with OCL constraints can be checked using bounded verification techniques, e.g., SAT or constraint programming (CP) solvers. ...
Hence, choosing suitable bounds is a non-trivial process as there is a trade-off between the verification time (faster for smaller domains) and the confidence in the result (better for larger domains). ...
Tim Nelson for their valuable comments. ...
doi:10.1109/tse.2017.2777830
fatcat:zn2nhmkfarbgnozlev2xm7a42i
Building free Binary Decision Diagrams using SAT solvers
2007
Facta universitatis - series Electronics and Energetics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Free Binary Decision Diagrams (FBDDs) are a data structure for the representation of Boolean functions. ...
In contrast to Ordered Binary Decision Diagrams (OBDDs) FBDDs allow different variable orderings along each path. ...
Binary decision diagrams As is well-known a Boolean function f can be represented by a Binary Decision Diagram (BDD) [1] . ...
doi:10.2298/fuee0703381w
fatcat:77lwuvcgajhudku5ra44vmlvim
Encoding Linear Constraints with Implication Chains to CNF
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For some problems which combine linear constraints with highly combinatorial constraints, the best solving method is translation to SAT. ...
Translation of a single linear constraint to SAT is a well studied problem, particularly for cardinality and pseudo-Boolean constraints. ...
linear constraints [5] , which in the special case of pseudo-Boolean constraints collapse to binary decision diagrams (BDDs). ...
doi:10.1007/978-3-319-23219-5_1
fatcat:tj62nn57dvelhlyvqxgr4pm5ha
Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Our algorithm is based on a decomposition of the original problem into subproblems that are represented as binary decision diagrams. ...
We present experimental results on combinatorial problems from MAP inference for Markov Random Fields, quadratic assignment, discrete tomography and cell tracking for developmental biology and show promising ...
First we define the type of binary decision diagrams we employ.
Binary Decision Diagrams Definition 5 (Binary decision diagram). ...
arXiv:2009.00481v2
fatcat:aq3kyrwrkbe2dfpjy4fekhpdvq
General Symmetry Breaking Constraints
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We present some general constraints for breaking symmetries in constraint satisfaction problems. These constraints can be used to break symmetries acting on variables, values, or both. ...
For example, a global constraint that combines together all the LexLeader constraints for row and column symmetries of a matrix model is NP-hard to propagate completely [5]. ...
Another representation used for a set variable is a binary decision diagram [16] . ...
doi:10.1007/11889205_46
fatcat:bu46uwzajbb4jnjt25k5jj7voq
An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems
2005
Artificial Intelligence Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed Constraint Satisfaction Problems. ...
It is the first algorithm for arc-consistency enforcement in this system setting. Arc-consistency is achieved whenever the overall system reaches quiescence after a constraint is added or deleted. ...
For this, we need dynamic constraint processing with distributed knowledge, which will allow to undo wrong search decisions without a global view to the problem. ...
doi:10.1007/s10462-005-9003-9
fatcat:eg2fm2xgdrfmvczfpiy2w4bmze
« Previous
Showing results 1 — 15 out of 13,979 results