Publikation:

Heuristic Search over Program Transformations

Vorschaubild

Dateien

Zinn_0-295797.pdf
Zinn_0-295797.pdfGröße: 347.48 KBDownloads: 294

Datum

2014

Autor:innen

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-0-295797
DOI (zitierfähiger Link)
https://doi.org/10.1007/978-3-319-08909-6_15
ArXiv-ID

Internationale Patentnummer

Link zur Lizenz
Urheberrechtlich geschützt

Angaben zur Forschungsförderung

Projekt

Deep cognitive diagnosis in intelligent tutoring systems in the framework of logic programming an meta-level reasoning
Open Access-Veröffentlichung
Open Access Green

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

HANUS, Michael, ed. and others. Declarative Programming and Knowledge Management : Declarative Programming Days, KDPD 2013 ; Unifying INAP, WFLP, and WLP, Kiel, Germany, September 11–13, 2013, Revised Selected Papers. Cham: Springer, 2014, pp. 234-249. Lecture Notes in Artificial Intelligence. 8439. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-08908-9. Available under: doi: 10.1007/978-3-319-08909-6_15

Zusammenfassung

In prior work, we have developed a method for the automatic reconstruction of buggy Prolog programs from correct programs to model learners' incorrect reasoning in a tutoring context. The method combines an innovative variant of algorithmic debugging with program transformations. Algorithmic debugging is used to indicate a learner's error and its type; this informs a program transformation that "repairs'' the expert program into a buggy variant that is closer at replicating a learner's behaviour. In this paper, we improve our method by using heuristic search. To search the space of program transformations, we estimate the distance between programs. Instead of only returning the first irreducible disagreement between program and Oracle, the algorithmic debugger now traverses the entire program. In the process, all irreducible agreements and disagreements are counted to compute the distance metrics, which also includes the cost of transformations. Overall, the heuristic approach is a significant improvement to our existing blind method.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Algorithmic Debugging, Intelligent Tutoring, Cognitive Diagnosis

Konferenz

KDPD 2013 : Kiel Declarative Programming Days 2013, 11. Sept. 2013 - 13. Sept. 2013, Kiel
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690ZINN, Claus, 2014. Heuristic Search over Program Transformations. KDPD 2013 : Kiel Declarative Programming Days 2013. Kiel, 11. Sept. 2013 - 13. Sept. 2013. In: HANUS, Michael, ed. and others. Declarative Programming and Knowledge Management : Declarative Programming Days, KDPD 2013 ; Unifying INAP, WFLP, and WLP, Kiel, Germany, September 11–13, 2013, Revised Selected Papers. Cham: Springer, 2014, pp. 234-249. Lecture Notes in Artificial Intelligence. 8439. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-08908-9. Available under: doi: 10.1007/978-3-319-08909-6_15
BibTex
@inproceedings{Zinn2014Heuri-31654,
  year={2014},
  doi={10.1007/978-3-319-08909-6_15},
  title={Heuristic Search over Program Transformations},
  number={8439},
  isbn={978-3-319-08908-9},
  issn={0302-9743},
  publisher={Springer},
  address={Cham},
  series={Lecture Notes in Artificial Intelligence},
  booktitle={Declarative Programming and Knowledge Management : Declarative Programming Days, KDPD 2013 ; Unifying INAP, WFLP, and WLP, Kiel, Germany, September 11–13, 2013, Revised Selected Papers},
  pages={234--249},
  editor={Hanus, Michael},
  author={Zinn, Claus}
}
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/31654">
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/31654"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:rights>terms-of-use</dc:rights>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:language>eng</dc:language>
    <dc:contributor>Zinn, Claus</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/31654/3/Zinn_0-295797.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:issued>2014</dcterms:issued>
    <dcterms:title>Heuristic Search over Program Transformations</dcterms:title>
    <dcterms:abstract xml:lang="eng">In prior work, we have developed a method for the automatic reconstruction of buggy Prolog programs from correct programs to model learners' incorrect reasoning in a tutoring context. The method combines an innovative variant of algorithmic debugging with program transformations. Algorithmic debugging is used to indicate a learner's error and its type; this informs a program transformation that "repairs'' the expert program into a buggy variant that is closer at replicating a learner's behaviour. In this paper, we improve our method by using heuristic search. To search the space of program transformations, we estimate the distance between programs.  Instead of only returning the first irreducible disagreement between program and Oracle, the algorithmic debugger now traverses the entire program. In the process, all irreducible agreements and disagreements are counted to compute the distance metrics, which also includes the cost of transformations. Overall, the heuristic approach is a significant improvement to our existing blind method.</dcterms:abstract>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-08-31T15:42:58Z</dc:date>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/31654/3/Zinn_0-295797.pdf"/>
    <dc:creator>Zinn, Claus</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-08-31T15:42:58Z</dcterms:available>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen