Presburger arithmetic

Results: 26



#Item
1Deciding Presburger Arithmetic Michael Norrish  National ICT Australia  Michael Norrish (National ICT Australia)

Deciding Presburger Arithmetic Michael Norrish National ICT Australia Michael Norrish (National ICT Australia)

Add to Reading List

Source URL: ssll.cecs.anu.edu.au

Language: English - Date: 2009-01-19 22:49:26
    2Deciding Presburger Arithmetic Michael Norrish  National ICT Australia  Michael Norrish (National ICT Australia)

    Deciding Presburger Arithmetic Michael Norrish National ICT Australia Michael Norrish (National ICT Australia)

    Add to Reading List

    Source URL: ssll.rsise.anu.edu.au

    Language: English - Date: 2009-01-19 22:49:26
      3Interpolating Quantifier-Free Presburger Arithmetic Daniel Kroening1 , Jérôme Leroux2 , and Philipp Rümmer1 1 2  Oxford University Computing Laboratory, United Kingdom

      Interpolating Quantifier-Free Presburger Arithmetic Daniel Kroening1 , Jérôme Leroux2 , and Philipp Rümmer1 1 2 Oxford University Computing Laboratory, United Kingdom

      Add to Reading List

      Source URL: www.labri.fr

      Language: English - Date: 2014-03-17 06:03:49
        4J´erˆome Leroux  Least Significant Digit First Presburger Automata DRAFT. Please do not distribute, but contact the author for a version

        J´erˆome Leroux Least Significant Digit First Presburger Automata DRAFT. Please do not distribute, but contact the author for a version

        Add to Reading List

        Source URL: www.labri.fr

        Language: English - Date: 2014-03-17 06:03:51
        5Application for a Dagstuhl Seminar Deduction and Arithmetic Nikolaj Bjørner Reiner H¨ahnle Tobias Nipkow

        Application for a Dagstuhl Seminar Deduction and Arithmetic Nikolaj Bjørner Reiner H¨ahnle Tobias Nipkow

        Add to Reading List

        Source URL: www.dagstuhl.de

        Language: English - Date: 2010-04-21 04:49:56
        6On the Satisfiability of Two-Variable Logic over Data Words Claire David, Leonid Libkin, and Tony Tan School of Informatics, University of Edinburgh  Abstract. Data trees and data words have been studied extensively

        On the Satisfiability of Two-Variable Logic over Data Words Claire David, Leonid Libkin, and Tony Tan School of Informatics, University of Edinburgh Abstract. Data trees and data words have been studied extensively

        Add to Reading List

        Source URL: alpha.uhasselt.be

        Language: English - Date: 2013-09-27 07:35:34
        7(UN)DECIDABLITY Undecidable: predicate calculus, Peano arithmetic (Church) Decidable: • Presburger arithmetic (Presburger) • Elementary theory of the ordered field R (Tarski)

        (UN)DECIDABLITY Undecidable: predicate calculus, Peano arithmetic (Church) Decidable: • Presburger arithmetic (Presburger) • Elementary theory of the ordered field R (Tarski)

        Add to Reading List

        Source URL: www.mathematik.uni-muenchen.de

        - Date: 2008-12-22 16:55:21
          8Regular graphs and the spectra of two-variable logic with counting Eryk Kopczy´ nski∗  Tony Tan†

          Regular graphs and the spectra of two-variable logic with counting Eryk Kopczy´ nski∗ Tony Tan†

          Add to Reading List

          Source URL: alpha.uhasselt.be

          Language: English - Date: 2014-07-02 10:40:42
          9Building a Calculus of Data Structures Viktor Kuncak1⋆ , Ruzica Piskac1 , Philippe Suter1 , and Thomas Wies2 1 EPFL School of Computer and Communication Sciences, Lausanne, Switzerland

          Building a Calculus of Data Structures Viktor Kuncak1⋆ , Ruzica Piskac1 , Philippe Suter1 , and Thomas Wies2 1 EPFL School of Computer and Communication Sciences, Lausanne, Switzerland

          Add to Reading List

          Source URL: lara.epfl.ch

          Language: English - Date: 2009-11-10 09:06:44
          10On Set-Driven Combination of Logics and Verifiers LARA Technical Report, February 2, 2009 Viktor Kuncak1 and Thomas Wies1,2 1 2

          On Set-Driven Combination of Logics and Verifiers LARA Technical Report, February 2, 2009 Viktor Kuncak1 and Thomas Wies1,2 1 2

          Add to Reading List

          Source URL: lara.epfl.ch

          Language: English - Date: 2009-02-02 09:55:31