Filters








8,266 Hits in 5.6 sec

Page 6521 of Mathematical Reviews Vol. , Issue 97J [page]

<span title="">1997</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Further, modelling techniques in CLP(PB), a constraint logic program- ming language over pseudo-Boolean constraints, are illustrated, and other constraint logic programming systems and constraint domains  ...  Second, a logic-based constraint solving approach for pseudo-Boolean con- straints is proposed. In Chapter 2, the author presents constraint logic programming (CLP).  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1997-10_97j/page/6521" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1997-10_97j/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 4889 of Mathematical Reviews Vol. , Issue 95h [page]

<span title="">1995</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
{For the entire collection see MR 95e:68006. } 95h:68021 68N17 68T20 Benhamou, Frédéric (F-PROVS-AI; Marseille) ; Massat, Jean-Luc (F-PROVS-AI; Marseille) Boolean pseudo-equations in constraint logic programming  ...  We give an algorithm which computes a normal form of Boolean constraint systems made up of equalities, disequalities and pseudo-equalities.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1995-08_95h/page/4889" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1995-08_95h/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

G4LTL-ST: Automatic Generation of PLC Programs [chapter]

Chih-Hong Cheng, Chung-Hao Huang, Harald Ruess, Stefan Stattelmann
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The synthesis algorithm of G4LTL-ST implements pseudo-Boolean abstraction of data constraints and the compilation of timing constraints into LTL, together with a counterstrategy-guided abstraction-refinement  ...  These specifications are expressed in a linear temporal logic (LTL) extended with non-linear arithmetic constraints and timing constraints on signals.  ...  new constraints as guarantees to the pseudo-Boolean specification.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-08867-9_36">doi:10.1007/978-3-319-08867-9_36</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sd76q5moorf6pkb7lcykr5l2ja">fatcat:sd76q5moorf6pkb7lcykr5l2ja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502153637/https://link.springer.com/content/pdf/10.1007%2F978-3-319-08867-9_36.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/40/d440a7fb8f51edad56f98c4976970b2beb4bf39a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-08867-9_36"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization [chapter]

Vasco Manquinho, João Marques-Silva
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algorithms derived from the Davis-Logemann-Loveland (DLL) procedure for Propositional Satisfiability (SAT).  ...  The utilization of cutting planes is a key technique in Integer Linear Programming (ILP).  ...  Hence, we propose to augment SAT-based PBO algorithms with bounding capability, associated with information obtained from the Pseudo-Boolean (PB) constraints and from the cost function 1 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11499107_38">doi:10.1007/11499107_38</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/khliq42p4be5vggcuxeuavbjte">fatcat:khliq42p4be5vggcuxeuavbjte</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922182632/https://eprints.soton.ac.uk/261995/1/jpms-sat05a.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b2/6d/b26dbaac3d3da28cef785260d9722bfc3a1fea2e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11499107_38"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On Using Cutting Planes in Pseudo-Boolean Optimization

Vasco M. Manquinho, João Marques-Silva, Daniel Le Berre, Laurent Simon
<span title="2006-03-01">2006</span> <i title="IOS Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3g435pzztvglji5oqf5am3q6ni" style="color: black;">Journal on Satisfiability, Boolean Modeling and Computation</a> </i> &nbsp;
However, cutting plane techniques are seldom used in Pseudo-Boolean Optimization (PBO) algorithms.  ...  Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP).  ...  Observe that a linear pseudo-boolean optimization problem can also be viewed as a special case of linear integer programming problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3233/sat190023">doi:10.3233/sat190023</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fhpppzox4namjluvfxpnxnshyq">fatcat:fhpppzox4namjluvfxpnxnshyq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811004659/http://sat.inesc.pt/~vmm/research/papers/jsat06.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/01/e1/01e15d57ecf62e6d07a8dec49bfc2b7ee9d2920a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3233/sat190023"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A New Hybrid Algorithm for FPGA Routing

Yulan Tang, Jianhui Chen
<span title="">2012</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lm2bbv3vfbgafhrpg542lqv47i" style="color: black;">Energy Procedia</a> </i> &nbsp;
Technique of static symmetry-breaking is also adding to carry out pretreatment of pseudo-Boolean constraints, detecting and breaking the symmetries in the routing flow.  ...  Then pseudo-Boolean Satisfiability algorithm is used when the process of Frontier is not successful.  ...  The new routing flow also uses static symmetry-breaking technology in the pretreatment stage to deal with pseudo-Boolean constraints.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.egypro.2012.01.153">doi:10.1016/j.egypro.2012.01.153</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k2p4xqwjkngaxgtq5pbzde42ve">fatcat:k2p4xqwjkngaxgtq5pbzde42ve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170926211403/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/456/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTg3NjYxMDIxMjAwMTYzNA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4d/d5/4dd5a48a82bfb697b3de576bd5fd66e9f4d52c38.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.egypro.2012.01.153"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Combining satisfiability techniques from AI and OR

HEIDI E. DIXON, MATTHEW L. GINSBERG
<span title="">2000</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ppliiwuwhjhjzdhxr5qnaaqsyi" style="color: black;">Knowledge engineering review (Print)</a> </i> &nbsp;
Our goal in this paper is to introduce the artificial intelligence community to pseudo-Boolean representation and cutting plane proofs, and to introduce the operations research community to restricted  ...  We also present a new cutting plane proof of the pigeonhole principle that is of size n 2 , and show how to implement some intelligent backtracking techniques using pseudo-Boolean representation.  ...  A pseudo-Boolean problem is an instance of a general problem class known as integer programming.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s0269888900001041">doi:10.1017/s0269888900001041</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sbiqott5kjenvkgnvzljxumxoq">fatcat:sbiqott5kjenvkgnvzljxumxoq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070205022000/http://www.cirl.uoregon.edu:80/dixon/papers/ker00.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/74/f474edb8a6b22ec2a8804c48983dd1114e38e541.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s0269888900001041"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

Satisfiability-based algorithms for pseudo-Boolean optimization using Gomory cuts and search restarts

V.M. Manquinho, J. Marques-Silva
<span title="">2005</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jsqaafbrfneh7jtfvpjfzhs3ni" style="color: black;">17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI&#39;05)</a> </i> &nbsp;
In contrast, the utilization of cutting planes in Pseudo-Boolean Optimization (PBO) is recent and results still preliminary.  ...  Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP).  ...  With this approach, we can safely add any new cuts to our set of pseudo-boolean constraints, guaranteeing the completeness of the algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ictai.2005.113">doi:10.1109/ictai.2005.113</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ictai/ManquinhoS05.html">dblp:conf/ictai/ManquinhoS05</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mbwgskrlovetbj7odqui7cxksa">fatcat:mbwgskrlovetbj7odqui7cxksa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081101020359/http://eprints.ecs.soton.ac.uk/11993/1/jpms-ictai05b.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bb/ef/bbefe65994ba9824a76cd1320b3fe4ff2a142d35.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ictai.2005.113"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Page 5361 of Mathematical Reviews Vol. , Issue 94i [page]

<span title="">1994</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
How to use symmetries in Boolean constraint solving (287-306); Frédéric Benhamou, Boolean algorithms in Prolog III (307-325); Alexander Bockmayr, Logic programming with pseudo-Boolean constraints (327  ...  Smolka, Residuation and guarded rules for constraint logic programming (405-419).  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1994-09_94i/page/5361" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1994-09_94i/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search

Jo Devriendt, Ambros Gleixner, Jakob Nordström
<span title="2021-01-18">2021</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ldxybeeoybgrrpc5b5v6mqdwty" style="color: black;">Constraints</a> </i> &nbsp;
Inspired by mixed integer programming (MIP), we address this problem by interleaving incremental LP solving with cut generation within the conflict-driven pseudo-Boolean search.  ...  Conflict-driven pseudo-Boolean solvers optimize 0-1 integer linear programs by extending the conflict-driven clause learning (CDCL) paradigm from SAT solving.  ...  The basic pseudo-Boolean search loop enhanced with linear programming is presented in Algorithm 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10601-020-09318-x">doi:10.1007/s10601-020-09318-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pbjdf3fzrvcovgzuchxy44b7yq">fatcat:pbjdf3fzrvcovgzuchxy44b7yq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210429051151/https://link.springer.com/content/pdf/10.1007/s10601-020-09318-x.pdf?error=cookies_not_supported&amp;code=bfb17d0f-5bfd-40e9-98dc-0514c4f958ca" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d7/a9/d7a9dc54b449824a6f5e5b9b6a01bd934e1da989.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10601-020-09318-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 581 of The Journal of the Operational Research Society Vol. 50, Issue 6 [page]

<span title="">1999</span> <i title="Palgrave Macmillan"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_journal-of-the-operational-research-society" style="color: black;">The Journal of the Operational Research Society</a> </i> &nbsp;
Logic Programming language).  ...  Some instances of the CLP scheme® are: CLP (R):” linear relations on rational and floating point numbers, CLP (PB):'° pseudo-Boolean constraints, CLP (BNR):'' interval arithmetic, CLP Correspondence: S  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_journal-of-the-operational-research-society_1999-06_50_6/page/581" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_journal-of-the-operational-research-society_1999-06_50_6/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Quadratization and Roof Duality of Markov Logic Networks

Roderick Sebastiaan De Nijs, Christian Landsiedel, Dirk Wollherr, Martin Buss
<span title="2016-03-25">2016</span> <i title="AI Access Foundation"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4ax4efcwajcgvidb6hcg6mwx4a" style="color: black;">The Journal of Artificial Intelligence Research</a> </i> &nbsp;
The procedure relies on a pseudo-Boolean representation of the model, and allows handling models of any order.  ...  The employed pseudo-Boolean representation can be used to identify problems that are guaranteed to be solvable in low polynomial-time.  ...  With the definition of first-order quadratizations, we can express the quadratization of the pseudo-Boolean probabilistic first-order logic model with parfactors G as P (x) = 1 Z exp   g∈G θ∈gr(Lg:Cg  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1613/jair.5023">doi:10.1613/jair.5023</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y6jk5vzr6fa6vfmp6vww2niv74">fatcat:y6jk5vzr6fa6vfmp6vww2niv74</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190308024804/http://pdfs.semanticscholar.org/e126/d7c60ddc3dcf2855a796a8894cb91e830b22.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e1/26/e126d7c60ddc3dcf2855a796a8894cb91e830b22.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1613/jair.5023"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Verification of Ptime reducibility for system F terms via Dual Light Affine Logic [article]

Vincent Atassi
<span title="2006-03-27">2006</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BaillotTerui04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms: all typable  ...  For that we give a procedure which, starting with a term typed in system F, finds all possible ways to decorate it into a DLAL typed term.  ...  Solving boolean constraints We divide Const(M ) into three disjoint sets Const b (M ), Const i (M ) and Const m (M ): • A boolean constraint s ∈ Const b (M ) consists of only boolean parameters. s is of  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0603104v1">arXiv:cs/0603104v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vprhuepk4ffm3liazicqjzq2u4">fatcat:vprhuepk4ffm3liazicqjzq2u4</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0603104/cs0603104.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/de/2e/de2ee9d10ac4982be98032c3f216b09327525e82.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0603104v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Comparing Constraint Programming and Mathematical Programming Approaches to Discrete Optimisation-The Change Problem

S. Heipcke
<span title="">1999</span> <i title="JSTOR"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fq4jrflj6zesjk7f4nb4otuwwy" style="color: black;">Journal of the Operational Research Society</a> </i> &nbsp;
Logic Programming language).  ...  Some instances of the CLP scheme® are: CLP (R):” linear relations on rational and floating point numbers, CLP (PB):'° pseudo-Boolean constraints, CLP (BNR):'' interval arithmetic, CLP Correspondence: S  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2307/3010615">doi:10.2307/3010615</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/erqxh2l7znarpnodofwmnped2y">fatcat:erqxh2l7znarpnodofwmnped2y</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_journal-of-the-operational-research-society_1999-06_50_6/page/581" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_journal-of-the-operational-research-society_1999-06_50_6/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2307/3010615"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> jstor.org </button> </a>

Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic [chapter]

Vincent Atassi, Patrick Baillot, Kazushige Terui
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms: all typable terms can  ...  For that we give a procedure which, starting with a term typed in system F, finds all possible ways to decorate it into a DLAL typed term.  ...  Solving boolean constraints b 1 = b 2 (in Ltype(M )) b = 1 (in Ltype(M )) b = 0 (in Bang(M )) b = 1 ⇒ b ′ = 1 (in Bang(M )) • A linear constraint s ∈ Const i (M ) deals with integer parameters only.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11874683_10">doi:10.1007/11874683_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gd5st3xswzdlxp7nrdblcfzdya">fatcat:gd5st3xswzdlxp7nrdblcfzdya</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140825161822/http://hal.inria.fr/docs/00/06/39/47/PDF/infdlal240306.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/82/a0/82a04521480cc3e4e3a4dff87c2814349059a0c0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11874683_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 8,266 results