Filters








217,310 Hits in 7.0 sec

Elimination of equality via transformation with ordering constraints [chapter]

Leo Bachmair, Harald Ganzinger, Andrei Voronkov
<span title="">1998</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;
We refine Brand's method for eliminating equality axioms by (i) imposing ordering constraints on auxiliary variables introduced during the transformation process and (ii) avoiding certain transformations  ...  of positive equations with a variable on one side.  ...  Conclusions We have described a refined variant of Brand's modification method via ordering constraints that also improves equality elimination as implemented in the prover Setheo.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0054259">doi:10.1007/bfb0054259</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xsztle3oofbhbag2nka7havaoy">fatcat:xsztle3oofbhbag2nka7havaoy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200307190337/http://www-cgi.cs.cmu.edu/afs/cs/user/fp/www/courses/atp/cmuonly/BGV98.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/aa/b0/aab0c8c0b889522008834228ea87ad74f9907dfc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0054259"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

CGRASS: A System for Transforming Constraint Satisfaction Problems [chapter]

Alan M. Frisch, Ian Miguel, Toby Walsh
<span title="">2003</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;
Transformations include adding constraints that are implied by other constraints, adding constraints that eliminate symmetrical solutions, removing redundant constraints and replacing constraints with  ...  This paper describes the CGRASS (Constraint Generation And Symmetry-breaking) system that can improve a problem model by automatically performing transformations of these kinds.  ...  Julian Richardson's adaptation of PRESS to manipulate inequalities and its success at generating a number of implied constraints automatically influenced our approach.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36607-5_2">doi:10.1007/3-540-36607-5_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iaeccxp7fjhz7lm7fnfnz5pfue">fatcat:iaeccxp7fjhz7lm7fnfnz5pfue</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090108200847/http://www.cse.unsw.edu.au/~tw/fmwercim2002.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/b4/1a/b41ad420328abccdb090006fc6afcf89ab8a8ee5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36607-5_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Connection Tableaux with Lazy Paramodulation [chapter]

Andrei Paskevich
<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;
Our calculus uses ordering constraints and a certain form of the basicness restriction.  ...  In this paper, we present a new connection tableau calculus for logic with equality.  ...  Thus a connection is established between lazy paramodulation and equality elimination via problem transformation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11814771_10">doi:10.1007/11814771_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4lifrskvszesho5yloqaza5w3y">fatcat:4lifrskvszesho5yloqaza5w3y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810075643/http://tertium.org/papers/jar-08.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/4b/f6/4bf6c906a3e11426399bed43cc181d6c644e4170.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11814771_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Connection Tableaux with Lazy Paramodulation

Andrei Paskevich
<span title="2007-12-11">2007</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2ewief65xnegfh2slwulpgsnba" style="color: black;">Journal of automated reasoning</a> </i> &nbsp;
Our calculus uses ordering constraints and a certain form of the basicness restriction.  ...  In this paper, we present a new connection tableau calculus for logic with equality.  ...  Thus a connection is established between lazy paramodulation and equality elimination via problem transformation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-007-9089-7">doi:10.1007/s10817-007-9089-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kk2qi5tcyvctpn3fhgatfttur4">fatcat:kk2qi5tcyvctpn3fhgatfttur4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810075643/http://tertium.org/papers/jar-08.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/4b/f6/4bf6c906a3e11426399bed43cc181d6c644e4170.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-007-9089-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Rewriting System for Convex Optimization Problems [article]

Akshay Agrawal, Robin Verschueren, Steven Diamond, Stephen Boyd
<span title="2019-01-22">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Translation is facilitated by reductions, which accept a category of problems and transform instances of that category to equivalent instances of another category.  ...  By treating reductions as first-class objects, our method makes it easy to match problems to solvers well-suited for them and to support solvers with a wide variety of standard forms.  ...  affine (by eliminating the piecewise-linear atoms via graph expansions, as described in §3.3).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1709.04494v2">arXiv:1709.04494v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2gydwzvxsff37acgimvw27xggm">fatcat:2gydwzvxsff37acgimvw27xggm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200831040614/https://arxiv.org/pdf/1709.04494v2.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/61/36/6136b334615d75bd5e67e156d7bc10d788228937.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1709.04494v2" 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>

A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems [chapter]

Martin Bromberger
<span title="">2018</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;
Together, the two transformations turn any system of linear mixed constraints into a bounded system, i.e., a system for which termination can be achieved easily.  ...  Instead of generating a priori bounds for the variables, e.g., as suggested by Papadimitriou, unbounded variables are eliminated through the two transformations.  ...  It dynamically eliminates one linear independent bounded direction at a time via transformation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-94205-6_22">doi:10.1007/978-3-319-94205-6_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fg56j2o54rd63m3vs5midf4zqy">fatcat:fg56j2o54rd63m3vs5midf4zqy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224212027/http://pdfs.semanticscholar.org/5e19/4fed0a57b2a9059802817f7a5f3be555a2c3.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/5e/19/5e194fed0a57b2a9059802817f7a5f3be555a2c3.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-94205-6_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems [article]

Martin Bromberger
<span title="2018-04-20">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Together, the two transformations turn any system of linear mixed constraints into a bounded system, i.e., a system for which termination can be achieved easily.  ...  Instead of generating a priori bounds for the variables, e.g., as suggested by Papadimitriou, unbounded variables are eliminated through the two transformations.  ...  It dynamically eliminates one linear independent bounded direction at a time via transformation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.07703v1">arXiv:1804.07703v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g4cydlxupvhxlaw4bo752mrmfy">fatcat:g4cydlxupvhxlaw4bo752mrmfy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200831150500/https://arxiv.org/pdf/1804.07703v1.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/a2/a7/a2a710edc49b00fea6d6df85283517e97ed4b478.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.07703v1" 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>

Speeding up Polyhedral Analysis by Identifying Common Constraints

Axel Simon
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
We expose a maximum of common equalities and inequalities by converting the polyhedra into a normal form and give experimental evidence of the merit of our method.  ...  In particular, we discuss how common equalities and certain inequalities can be omitted from the calculation without aecting the result.  ...  wishes to thank Duong Nguyen Que for making the benchmark suite available; also Liqian Chen and Antoine Min e for useful discussions and Enea Zaanella for his insightful comments on an earlier version of  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2010.09.011">doi:10.1016/j.entcs.2010.09.011</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7yw7aemoqjacnlx5fcrobrtm3y">fatcat:7yw7aemoqjacnlx5fcrobrtm3y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922224144/http://www2.in.tum.de/bib/files/simon10speeding.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/66/2f/662f07add6368238a5c0f4a2dfc6908864965f42.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2010.09.011"> <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>

Proper Dirac quantization of a free particle on a D-dimensional sphere

Hagen Kleinert, Sergei V. Shabanov
<span title="">1997</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/j5vumr4o65agbmeqovmzt67pqe" style="color: black;">Physics Letters A</a> </i> &nbsp;
The energy spectrum is equal to that of a pure Laplace-Beltrami operator with no additional constant arising from the curvature of the sphere.  ...  constraints, which are of first class in Dirac's classification scheme.  ...  Thus experiment eliminates an extra curvature scalar, in agreement with Podolsky and with the quantization of angular momentum.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0375-9601(97)00410-6">doi:10.1016/s0375-9601(97)00410-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3yjqu4baxrekdlzuouvlirfaka">fatcat:3yjqu4baxrekdlzuouvlirfaka</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180726201635/http://cds.cern.ch/record/319556/files/9702006.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/5d/4a/5d4a993e712c1a6b60db435dc788ee2087ce624e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0375-9601(97)00410-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Basic Operators for Solving Constraints via Collaboration of Solvers [chapter]

Carlos Castro, Eric Monfroy
<span title="">2001</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;
We exemplify the use of this language by describing some well known techniques for solving constraints over finite domains and non-linear constraints over real numbers via collaboration of solvers.  ...  In this paper, we propose a strategy language for designing schemes of constraint solver collaborations: a set of strategy operators enables one to design several kinds of collaborations.  ...  In order to carry out enumeration, we consider the solver SplitDomain which transforms a domain constraint into a disjunction of two domain constraints if the width of the original domain is greater than  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44990-6_11">doi:10.1007/3-540-44990-6_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/keg76syx2jexhiwmb3rj7aov5m">fatcat:keg76syx2jexhiwmb3rj7aov5m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719155134/https://ir.cwi.nl/pub/1883/1883D.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/6a/86/6a86e0e8d85bdc8a48e3afe4ba24af25f6d30c00.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44990-6_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Algebraic elimination of slide surface constraints in implicit structural analysis

Edmond Chow, Thomas A. Manteuffel, Charles Tong, Bradley K. Wallin
<span title="">2003</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/d5kmo4wqzvfsdp5d4ufrrlufwy" style="color: black;">International Journal for Numerical Methods in Engineering</a> </i> &nbsp;
This method can be extended to the case where constrained surfaces intersect and leads to a graph theoretic approach for determining which variables can be eliminated efficiently for constraints with more  ...  When there are m constraints and there exists a set of m variables where each variable is only involved in a single constraint, we advocate a direct elimination technique which leaves a sparse, positive  ...  Acknowledgments The authors are grateful to Ivan Otero, who originally formulated implicit slide surface constraints, and John Ruge, who suggested revisiting the use of Lagrange multipliers for the sake  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/nme.720">doi:10.1002/nme.720</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5mqa3zki55gldnuq6gijcrnz6m">fatcat:5mqa3zki55gldnuq6gijcrnz6m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20041019113738/http://www.llnl.gov:80/CASC/people/chow/pubs/ale.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/d5/a6/d5a633379ed007b546b0c3a14d2b805151e8eaa7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/nme.720"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Self-scaling fast rotations for stiff and equality-constrained linear least squares problems

Andrew A. Anda, Haesun Park
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wsx3rzhpingfvewcn5nwhfkq3e" style="color: black;">Linear Algebra and its Applications</a> </i> &nbsp;
We show that both fast and stamlard (,ivens rotation-based algorithms produce accurate results, regardless of row sortin K and even with extremely large weights, when equali~:-constrained leztst squares  ...  This makes the last plane rotation a methc~t of choice for the QR decx~mposition of stiff matrices, since it is also competitive in computational complexiQ'.  ...  These problems appear when an equality-constrained linear least squares problem is solved via extreme weighting of the constraint equations, tbr example.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0024-3795(94)00092-1">doi:10.1016/0024-3795(94)00092-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mbs4xuznbresrjhsdsojb3jicq">fatcat:mbs4xuznbresrjhsdsojb3jicq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171003102718/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/c9b/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMDI0Mzc5NTk0MDAwOTIx.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/7f/30/7f30384ce22283785019823e0e565b9fd278996b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0024-3795(94)00092-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Anyons and singular gauge transformations

A. Foerster, H.O. Girotti
<span title="">1989</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xefhbpc6n5fzpn6t7c45s6623i" style="color: black;">Physics Letters B</a> </i> &nbsp;
A (2 + 1 )-dimensional theory of charged scalar particles coupled to an abehan gauge field with Chern-Slmons term In the action is canonically quantlzed in the Coulomb and superaxlal gauges The gauge transformatmn  ...  As is known gauge theories fall into the class of constrained systems, the first-class constraints acting as independent generators of gauge transformattons [ 1 ] In order to quant~ze the theory one  ...  must first suppress all gauge freedom by brmgmg into the game subsidiary (gauge) condttions, whtch together with the constraints form a set of second-class constraints The classical-quantum transttion  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0370-2693(89)91657-2">doi:10.1016/0370-2693(89)91657-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jlge3rmknrc5rofhcf5ec6vsge">fatcat:jlge3rmknrc5rofhcf5ec6vsge</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723053829/https://lume.ufrgs.br/bitstream/handle/10183/140547/000014815.pdf;jsessionid=498EC7E72F57E612ACB7A4903FAB62C8?sequence=1" 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/1e/d6/1ed66b7845027f8c708fc86af54cb04774e03290.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0370-2693(89)91657-2"> <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>

Nonlinear realizations of symmetries and unphysical Goldstone bosons

I. N. McArthur
<span title="">2010</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/f77v2fl37rdyrodjisfjo6jbee" style="color: black;">Journal of High Energy Physics</a> </i> &nbsp;
These Goldstone bosons are unphysical, in that they can be eliminated in favour of other Goldstone bosons either via their equations of motion or via the imposition of an inverse Higgs constraint.  ...  In this paper, we examine the inter-relationship between the coset parameterization necessary to implement the inverse Higgs constraint, the equivalence of the inverse Higgs constraint to equations of  ...  The Goldstone bosons ξ α associated with the broken Lorentz generators T α are unphysical and can either be eliminated via their equations of motion or via the imposition of an inverse Higgs constraint  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/jhep11(2010)140">doi:10.1007/jhep11(2010)140</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cxvvq4hrivcpzl7bk5vlhjemwi">fatcat:cxvvq4hrivcpzl7bk5vlhjemwi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200909153532/https://arxiv.org/pdf/1009.3696v1.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/66/18/6618833f3c20d5d71962597952ece5779cabc2c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/jhep11(2010)140"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>

Set-based pre-processing for points-to analysis

Yannis Smaragdakis, George Balatsouras, George Kastrinis
<span title="">2013</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6y3m32grtnfktkp2oo6oqjbvta" style="color: black;">Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages &amp; applications - OOPSLA &#39;13</a> </i> &nbsp;
In experiments with Java programs, set-based pre-analysis eliminates 30% of the program's local variables and 30% or more of computed context-sensitive points-to facts, over a wide set of benchmarks and  ...  Computing constraints at the set level results in significant optimization opportunities: we can rewrite the input program into a simplified form with the same essential points-to properties.  ...  For the third instruction, the rule is instantiated with to equal to program variable "r" and from equal to program variable "q".  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2509136.2509524">doi:10.1145/2509136.2509524</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/oopsla/SmaragdakisBK13.html">dblp:conf/oopsla/SmaragdakisBK13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xnythvgk25d4jlflofumozhyy4">fatcat:xnythvgk25d4jlflofumozhyy4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140630144530/http://cgi.di.uoa.gr/~smaragd/set-based-oopsla13.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/c8/3b/c83b6a0c28b6438df521aff1d141d8c4f04a9d7c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2509136.2509524"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 217,310 results