MSE 2018 Benchmarks : Visibly Pushdown Automata Minimization

Lade...
Vorschaubild
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2018
Autor:innen
Heizmann, Matthias
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
BACCHUS, Fahiem, ed., Matti JÄRVISALO, ed., Ruben MARTINS, ed.. MaxSAT Evaluation 2018 : Solver and Benchmark Descriptions. Helsinki: Department of Computer Science, 2018, pp. 39-40. Department of Computer Science Series of Publications B. B-2018-2
Zusammenfassung

We describe a benchmark set consisting of 67 partial Max-SAT problem instances. The benchmarks come from an automata minimization approach. Each benchmark formula encodes constraints on an equivalence relation over automaton states. Any assignment satisfying the constraints corresponds to a relation that allows us to reduce the size of the automaton without changing its language. The more soft clauses are set to true, the coarser the relation and the smaller the resulting automaton.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
MaxSAT Evaluation 2018, 9. Juli 2018 - 12. Juli 2018, Oxford
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690HEIZMANN, Matthias, Christian SCHILLING, 2018. MSE 2018 Benchmarks : Visibly Pushdown Automata Minimization. MaxSAT Evaluation 2018. Oxford, 9. Juli 2018 - 12. Juli 2018. In: BACCHUS, Fahiem, ed., Matti JÄRVISALO, ed., Ruben MARTINS, ed.. MaxSAT Evaluation 2018 : Solver and Benchmark Descriptions. Helsinki: Department of Computer Science, 2018, pp. 39-40. Department of Computer Science Series of Publications B. B-2018-2
BibTex
@inproceedings{Heizmann2018Bench-53643,
  year={2018},
  title={MSE 2018 Benchmarks : Visibly Pushdown Automata Minimization},
  url={http://hdl.handle.net/10138/237139},
  number={B-2018-2},
  publisher={Department of Computer Science},
  address={Helsinki},
  series={Department of Computer Science Series of Publications B},
  booktitle={MaxSAT Evaluation 2018 : Solver and Benchmark Descriptions},
  pages={39--40},
  editor={Bacchus, Fahiem and Järvisalo, Matti and Martins, Ruben},
  author={Heizmann, Matthias and Schilling, Christian}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/53643">
    <dc:contributor>Schilling, Christian</dc:contributor>
    <dc:rights>terms-of-use</dc:rights>
    <dc:language>eng</dc:language>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Schilling, Christian</dc:creator>
    <dc:contributor>Heizmann, Matthias</dc:contributor>
    <dc:creator>Heizmann, Matthias</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-05-11T09:58:07Z</dc:date>
    <dcterms:abstract xml:lang="eng">We describe a benchmark set consisting of 67 partial Max-SAT problem instances. The benchmarks come from an automata minimization approach. Each benchmark formula encodes constraints on an equivalence relation over automaton states. Any assignment satisfying the constraints corresponds to a relation that allows us to reduce the size of the automaton without changing its language. The more soft clauses are set to true, the coarser the relation and the smaller the resulting automaton.</dcterms:abstract>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/53643"/>
    <dcterms:issued>2018</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-05-11T09:58:07Z</dcterms:available>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:title>MSE 2018 Benchmarks : Visibly Pushdown Automata Minimization</dcterms:title>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
2020-12-14
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen