Filters








37,304 Hits in 4.7 sec

Partial order programming (extended abstract)

D. S. Parker
1989 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89  
A path from Vi, to vim in G is a sequence of edges , , ' ' ' , in E, and the cost of this path is aili + ai2i3 + ' ' ' + aimtim* For every node Vi, the problem is to compute the node cost Ui, which is  ...  We introduce a programming paradigm in which statements are constraints over partial orders. A partial order programming problem has the form minimize 24 The problem is to find values for ul, . . .  ...  In 1983 Paul Eggert and the author came up with the idea of 'relaxation programming'. This paper is a result of several years of subsequent ruminations.  ... 
doi:10.1145/75277.75300 dblp:conf/popl/Parker89 fatcat:shlywumy6fdj7jx2zdj3eljwlu

GUBS Upper Bound Solver (Extended Abstract)

Martin Avanzini, Michael Schaper
2017 Electronic Proceedings in Theoretical Computer Science  
In this extended abstract we present the GUBS Upper Bound Solver.  ...  GUBS is a dedicated constraint solver over the naturals for inequalities formed over uninterpreted function symbols and standard arithmetic operations.  ...  The development of GUBS was motivated by the lack of dedicated constraint solvers for polynomial inequalities. In future work, we would like to extend GUBS in various directions.  ... 
doi:10.4204/eptcs.248.6 fatcat:jfdsl4gdqnbcvg64oboggem5wq

Simplifying Casts and Coercions (Extended Abstract)

Robert Y. Lewis, Paul-Nicolas Madelaine
2020 Conference on Automated Deduction  
They are used extensively to eliminate boilerplate arguments in the Lean mathematical library and in external developments.  ...  We thank an anonymous reviewer for enlightening examples of how such problems can be dealt with in other systems. We  ...  The same is true in Lean, and one benefit of norm_cast is that it works even in the absence of definitional equalities, as is often the case with abstract algebraic structures.  ... 
dblp:conf/cade/LewisM20 fatcat:jq4fm6xplfd2rmyy7rzekd2ype

The Horn recursion for Schur P- and Q- functions: Extended Abstract [article]

Kevin Purbhoo, Frank Sottile
2006 arXiv   pre-print
Using a mixture of combinatorics of root systems, combinatorial linear algebra in Lie algebras, and the geometry of certain cominuscule flag varieties, we give Horn recursions to determine when these other  ...  Our inequalities come from the usual Littlewood-Richardson numbers, and while we give two very different Horn recursions, they have the same sets of solutions.  ...  Thus The Horn-type inequalities we give are naturally stated in terms of symmetric Littlewood-Richardson numbers.  ... 
arXiv:math/0603180v1 fatcat:psjycccqunflrdft4rv46fti6a

On the complexity of database queries (extended abstract)

Christos H. Papadimitriou, Mihalis Yannakakis
1997 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '97  
We are now ready to define the classes in the W hierarchy; we give the definition in terms of their complete problems.  ...  Fortunately, it turns out that the model checking problem for LTL specification (6 and program P can be solved in time exponential in 141 and linear in lPl [9].  ... 
doi:10.1145/263661.263664 dblp:conf/pods/PapadimitriouY97 fatcat:yhhdf7qrffdd5oo66l2cakzbsu

New Opportunities for the Formal Proof of Computational Real Geometry? (Extended Abstract)

Erika Ábrahám, James Davenport, Matthew England, Gereon Kremer, Zak Tonks
2020 CEUR Workshop Proceedings  
The purpose of this paper is to explore the question "to what extent could we produce formal, machineverifiable, proofs in real algebraic geometry?"  ...  We present the thesis that a new algorithm for ascertaining satisfiability of formulae over the reals via Cylindrical Algebraic Coverings [Ábrahám, Davenport, England, Kremer, Deciding the Consistency  ...  Cylindrical Algebraic Decomposition (CAD) was introduced by Collins in Virtual Term Substitution (VTS) was introduced by Weispfenning in [22] , and many developments are gathered in [14, 15] .  ... 
doi:10.18154/rwth-2021-09565 fatcat:pn4r7ur7zzehjek6wfi5zes52y

New Opportunities for the Formal Proof of Computational Real Geometry? (Extended Abstract)

Erika Ábrahám, James H. Davenport, Matthew England, Gereon Kremer, Zak Tonks
2020 Conference on Automated Deduction  
The purpose of this paper is to explore the question "to what extent could we produce formal, machineverifiable, proofs in real algebraic geometry?"  ...  We present the thesis that a new algorithm for ascertaining satisfiability of formulae over the reals via Cylindrical Algebraic Coverings [Ábrahám, Davenport, England, Kremer, Deciding the Consistency  ...  Cylindrical Algebraic Decomposition (CAD) was introduced by Collins in Virtual Term Substitution (VTS) was introduced by Weispfenning in [22] , and many developments are gathered in [14, 15] .  ... 
dblp:conf/cade/AbrahamDEKT20 fatcat:rii5ajbog5cnph7eelahlx44ou

Filters and Functions in Multi-scale Constructions: Extended Abstract [article]

Wayne M. Lawton
2014 arXiv   pre-print
Then we develop multi-scale constructions for dilations by Pisot-Vijayaraghavan numbers and translations in associated quasilattices.  ...  Combining these three inequalities completes the proof.  ...  Mahler measure arises in prediction theory of stationary random processes [17] , algebraic dynamics [11] , and in Lehmer' s open problem in number theory [24] .  ... 
arXiv:1411.0434v1 fatcat:cmstllgk65ddzbwum3dchpv2cu

New Applications of the Incompressibility Method (Extended Abstract) [chapter]

Harry Buhrman, Paul Vitányi, Tao Jiang, Ming Li
1999 Lecture Notes in Computer Science  
Such lower bounds have been difficult to obtain in the past by other methods.  ...  In this paper we present four new results and also give four new proofs of known results to demonstrate the power and elegance of the new method.  ...  Here we present a new simple incompressibility proof establishing an upper bound on the average-case complexity of finding the majority which is precise in the first term.  ... 
doi:10.1007/3-540-48523-6_19 fatcat:rjcftm67n5fn3ndynpc2fgqcza

Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration (extended version) [article]

Dario Cattaruzza, Alessandro Abate, Peter Schrammel, Daniel Kroening
2017 arXiv   pre-print
In turn, this tremendous gain allows us to improve on precision by computing more expensive abstractions.  ...  In this paper, we present an extension of abstract acceleration to linear loops with inputs, which correspond to discrete-time LTI control systems under guard conditions.  ...  In the first instance we note that we have eliminated all negative terms in the sums in equation (44) .  ... 
arXiv:1506.05607v5 fatcat:bkek7tbrcnemvibj5y4pvmnfia

General synthetic domain theory — A logical approach (extended abstract) [chapter]

B. Reus, Th. Streicher
1997 Lecture Notes in Computer Science  
Finally, we acknowledge that Paul Taylor's diagram macros are in use.  ...  Acknlowedgement We would like to thank Eugenio Moggi, Pino Rosolini, and Alex Simpson for many comments and fruitful discussions and Achim Jung for pointing out a detour in a previous version.  ...  In this paper, of which an extended abstract has already appeared in (Reus & Streicher, 1997) , our aim is to give an analogous account of Naive SDT though we probably will not achieve that extent of  ... 
doi:10.1007/bfb0026995 fatcat:cfvcvo5xcjfcfdy7wuh7e7male

Descriptive complexity for pictures languages (extended abstract) [article]

Etienne Grandjean and Frédéric Olive and Gaétan richard
2012 arXiv   pre-print
They are obtained in a general and uniform framework that allows to extend them to other "regular" structures.  ...  GRST96 of the class of recognizable picture languages in existential monadic second-order logic. - We state several logical characterizations of the class of picture languages recognized in linear time  ...  Then, Lemma Appendix A.8 gives the translation of R-atomic formulas into formulas expressed in term of the R α 's.  ... 
arXiv:1201.5853v1 fatcat:5tv3eosk6zbb5prfkwkrsrwbge

On Variable Orderings in MCSAT for Non-linear Real Arithmetic : (extended abstract)

Jasper Nalbach, Gereon Lukas Kremer, Erika Ábrahám
2019 CEUR Workshop Proceedings  
In classical lazy SMT solving, the search is decomposed in two interacting modules: at the Boolean level, truth values are searched for the theory constraints of an input formula such that the Boolean  ...  Satisfiability-modulo-theories (SMT ) solving is a technique for checking the satisfiability of logical formulas.  ...  SAT solving.  ... 
doi:10.18154/rwth-conv-240068 fatcat:245p44r2vngf7j2w5puijg3tda

Towards a Calculus for Non-Linear Spectral Gaps [Extended Abstract] [article]

Manor Mendel, Assaf Naor
2009 arXiv   pre-print
Such remarkable graph families were previously known to exist due to a tour de force algebraic construction of Lafforgue.  ...  Non-linear spectral gaps arise often in the theory of metric embeddings, and in the present paper we systematically study the theory of non-linear spectral gaps, partially in order to obtain a combinatorial  ...  Extended abstract. To be published (in abridged form) in the proceedings of the ACM-SIAM Symposium on Discrete Algorithms 2010 (SODA '10).  ... 
arXiv:0910.2041v1 fatcat:bbzobjdxzzad7jziciefjptw7a

Discrete Prediction Games with Arbitrary Feedback and Loss (Extended Abstract) [chapter]

Antonio Piccolboni, Christian Schindelhauer
2001 Lecture Notes in Computer Science  
We evaluate the performance against the best constant predictor (regret), as it is common in iterated game analysis.  ...  We show that for any discrete loss function and feedback function only one of two situations can occur: either there is a prediction strategy that achieves in Ì rounds a regret of at most Ç´Ì ¿ ´ÐÒ Ì µ  ...  Given this claim, we have by Markov's inequality that È Ì Ã AE AE Ã which, by some algebra, is equivalent to (1).  ... 
doi:10.1007/3-540-44581-1_14 fatcat:5jltob57fbegrlrp2zs3q7suaa
« Previous Showing results 1 — 15 out of 37,304 results