Filters








11,304 Hits in 4.5 sec

Boolean Constrained Encoding: A New Formulation And A Case Study

N.L. Vilar Calazans
IEEE/ACM International Conference on Computer-Aided Design  
However, the case study is primarily intended to show the feasibility of the Boolean constrained encoding problem formulation.  ...  We furnish a formal definition for the Boolean constrained encoding problem, and show that this definition encompasses many particular encoding problems found in VLSI design, at various description abstraction  ...  The encoding problem case study showed the limitations of previous generic problem formulations to constrained encoding and stressed the potential benefits of using our proposal.  ... 
doi:10.1109/iccad.1994.629899 dblp:conf/iccad/Calazans94 fatcat:3zic3mobq5fkblpl6agufutfqe

Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems

Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
Pseudo-Boolean (PB) constraints are usually encoded into Boolean clauses using compact Binary Decision Diagram (BDD) representations.  ...  We provide empirical evidence of the usefulness of this technique for some Resource-Constrained Project Scheduling Problem (RCPSP) variants, namely the Multi-Mode RCPSP (MRCPSP) and the RCPSP with Time-Dependent  ...  We thank the authors of [Vilím et al., 2015; Szeredi and Schutt, 2016] for sharing with us the FDS and LCG solvers, and the author of [Hartmann, 2013; 2015] for sharing the heuristics results for  ... 
doi:10.24963/ijcai.2017/78 dblp:conf/ijcai/BofillCSV17 fatcat:tblmwuuvarh4hj6kcikz5zvt7e

Decoding Choice Encodings

Uwe Nestmann, Benjamin C. Pierce
2000 Information and Computation  
We study two encodings of the asynchronous π-calculus with input-guarded choice into its choice-free fragment.  ...  The correctness proofs for the two choice encodings introduce a novel proof technique exploiting the properties of explicit decodings from translations to source terms.  ...  Robin Milner, Davide Sangiorgi, Peter Sewell, and the rest of the Edinburgh/Cambridge Pi Club and the Dienstagsclub at Erlangen joined us in many productive discussions.  ... 
doi:10.1006/inco.2000.2868 fatcat:v67xiunnyndtrcmt7ykwfdgexy

Decoding Choice Encodings

Uwe Nestmann, Benjamin C. Pierce
1999 BRICS Report Series  
We study two encodings of the asynchronous pi-calculus with input-guarded choice into its choice-free fragment.  ...  The correctness proofs for the two choice encodings introduce a novel proof technique exploiting the properties of explicit decodings from translations to source terms.  ...  We use expansions to define an up-to technique in Section 2.5, and to precisely formulate the correctness of an encoding in Section 5.5.  ... 
doi:10.7146/brics.v6i42.20112 fatcat:nw7a635z4jf6nksfmsiji66oo4

Decoding choice encodings [chapter]

Uwe Nestmann, Benjamin C. Pierce
1996 Lecture Notes in Computer Science  
We study two encodings of the asynchronous π-calculus with input-guarded choice into its choice-free fragment.  ...  The correctness proofs for the two choice encodings introduce a novel proof technique exploiting the properties of explicit decodings from translations to source terms.  ...  We use expansions to define an up-to technique in Section 2.5, and to precisely formulate the correctness of an encoding in Section 5.5.  ... 
doi:10.1007/3-540-61604-7_55 fatcat:s4jdplntfjfj5gedznzy5nk4a4

Successful SAT Encoding Techniques

Magnus Björk
2009 Journal on Satisfiability, Boolean Modeling and Computation  
There is consensus that encoding techniques usually have a dramatic impact on the efficiency of the SAT solver, that it often takes much work to find a good encoding, and that the size of an encoding is  ...  Topics where the interviewees disagree include the feasibility of including arithmetics in SAT problems and whether to formulate problems as clauses or circuits.  ...  Thanks also to Niklas Sörensson and Nicholas Smallbone for their proofreading of the article.  ... 
doi:10.3233/sat190085 fatcat:eyglyumxkrexdf5p2dpriolz2a

Optimum functional decomposition using encoding

Rajeev Murgai, Robert K. Brayton, Alberto Sangiovanni-Vincentelli
1994 Proceedings of the 31st annual conference on Design automation conference - DAC '94  
We formulate the optimum decomposition problem using encoding. In general, an input-output encoding formulation has to be employed.  ...  The last condition is really not a constraint, since each extra code bit means that an extra table has to be used (and that could be expensive).  ...  Acknowledgements We wish to thank Tiziano Villa for many helpful discussions and teaching us how to use the encoding tool [11] .  ... 
doi:10.1145/196244.196440 dblp:conf/dac/MurgaiBS94 fatcat:3ezzz4rqbffjrodprvpktkjn5q

meSAT: multiple encodings of CSP to SAT

Mirko Stojadinović, Filip Marić
2014 Constraints  
However, there is no single encoding that performs well on all classes of problems and there is a need for a system that supports multiple encodings.  ...  One approach for solving Constraint Satisfaction Problems (CSP) (and related Constraint Optimization Problems (COP)) involving integer and Boolean variables is reduction to propositional satisfiability  ...  We also wish to thank Naoyuki Tamura for some clarifications about the order encoding and the Sugar system, Peter Stuckey for providing information about MiniZinc, and Emmanuel Hebrard for providing some  ... 
doi:10.1007/s10601-014-9165-7 fatcat:nrtlxcewrjdpdco7wdpiytabne

Encoding process discovery problems in SMT

Marc Solé, Josep Carmona
2016 Journal of Software and Systems Modeling  
By encoding the problem into the logical/arithmetic domains and using modern SMT engines, it is shown how two separate families of process models can be discovered.  ...  Process Mining, a discipline in between Data Mining and Software Engineering, proposes tailored algorithms to exploit the information stored in a log, in order to reason about the processes underlying  ...  Acknowledgments This work as been partially supported by funds from the Spanish Ministry for Economy and Competitiveness (MINECO) and the European Union (FEDER funds) under grant COMMAS (ref.  ... 
doi:10.1007/s10270-016-0536-y fatcat:q2a3hssxwzafbdp4mdo2fym3by

Results in Workflow Resiliency: Complexity, New Formulation, and ASP Encoding [article]

Philip W. L. Fong
2018 arXiv   pre-print
While decremental and dynamic resiliency are both PSPACE-complete, Wang and Li did not provide a matching lower and upper bound for the complexity of static resiliency.  ...  First proposed by Wang and Li in 2007, workflow resiliency is a policy analysis for ensuring that, even when an adversarial environment removes a subset of workers from service, a workflow can still be  ...  Two notable lines of recent research explore new directions in the study of workflow resiliency. Mace et al.  ... 
arXiv:1809.10106v1 fatcat:r22ockql4jfhlhhqymayk6x744

Footstep Planning with Encoded Linear Temporal Logic Specifications [article]

Vikram Ramanathan
2020 arXiv   pre-print
This article presents an approach to encode Linear Temporal Logic (LTL) Specifications into a Mixed Integer Quadratically Constrained Quadratic Program (MIQCQP) footstep planner.  ...  Simulations of the footstep planner in a 2D environment satisfying encoded LTL specifications demonstrate the results of this research.  ...  operator is true), and ¬ and ∧ are the negation and conjuction Boolean operators respectively.  ... 
arXiv:2008.13661v1 fatcat:haklgrybljahpd7cwx5p7qg5zq

An efficient algorithm for constrained encoding and its applications

Chuan-Jin Shi, J.A. Brzozswski
1993 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Abstracr-In this paper, an efficient algorithm and its implementation ENCORE are presented for finding approximate solutions to dichotomy-based constrained encoding, a problem fundamental to the synthesis  ...  Index Terms-constrained encoding, state assignment, logic synthesis asynchronous circuits, PLA decomposition, local search heuristics. Janusz A. (John) Brzozowski (M'87) received the B.A.Sc. and M.A.  ...  PROBLEM FORMULATION In this section we give a mathematical formulation of constrained encoding.  ... 
doi:10.1109/43.251145 fatcat:mi2rmbtu65edtaj7nrsbkrx5ou

Full Dynamic Substitutability by SAT Encoding [chapter]

Steven Prestwich
2004 Lecture Notes in Computer Science  
In experiments on unsatisfiable problems, better results are obtained than with standard SAT encodings.  ...  This paper shows that full dynamic substitutability can be broken in a CSP by reformulating it as a SAT problem.  ...  Thanks to Gene Freuder and other 4C members for helpful discussions, and to the anonymous referees for useful comments.  ... 
doi:10.1007/978-3-540-30201-8_38 fatcat:dc5supuj7zcxpot37gycabfxeu

Exploiting Cardinality Encodings in Parallel Maximum Satisfiability

Ruben Martins, Vasco Manquinho, Inês Lynce
2011 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence  
Cardinality constraints appear in many practical problems and have been well studied in the past.  ...  This paper examines a large number of cardinality encodings and evaluates their performance for solving the problem of Maximum Satisfiability (MaxSAT).  ...  A special case of cardinality constraints are the at-most-one constraints. These constraints express that at most one out of n Boolean variables is allowed to be true.  ... 
doi:10.1109/ictai.2011.54 dblp:conf/ictai/MartinsML11 fatcat:yydmmp2kz5fklixsndtdxqqpjm

A "Fuzzy"-Logic Language for Encoding Multiple Physical Traits in Biomolecules

Shira Warszawski, Ravit Netzer, Dan S. Tawfik, Sarel J. Fleishman
2014 Journal of Molecular Biology  
How such often opposing traits are encoded in a macromolecular system is critical to our understanding of evolutionary processes and ability to design new molecules with desired functions.  ...  We present a framework for constraining design simulations to balance different physical characteristics.  ...  Acknowledgments We thank all members of the Fleishman laboratory who read and commented on this manuscript, as well as Ingemar Andre and Amnon Horovitz for critical discussion. Research in the  ... 
doi:10.1016/j.jmb.2014.10.002 pmid:25311857 pmcid:PMC4270444 fatcat:s6ocymvaybffxfsyhmvcn2puem
« Previous Showing results 1 — 15 out of 11,304 results