Model Exploration by Confidence with Completely Specified Counterexamples

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Toggle side column

Model Exploration by Confidence with Completely Specified Counterexamples

Daniel BorchmannDaniel Borchmann
Daniel Borchmann
Model Exploration by Confidence with Completely Specified Counterexamples
Technical Report, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, volume 13-11, 2013. LTCS-Report
  • KurzfassungAbstract
    We present an extensions of our previous work on axiomatizing confident general concept inclusions in given finite interpretations. Within this extension we allow external experts to interactively provide counterexamples to general concept inclusions with otherwise enough confidence in the given data. This extensions allows us to distinguish between erroneous counterexamples in the data and rare, but valid counterexamples.
  • Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ Borc-LTCS-13-11,
  address = {Dresden, Germany},
  author = {Daniel {Borchmann}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {13-11},
  title = {{Model Exploration by Confidence with Completely Specified Counterexamples}},
  type = {LTCS-Report},
  year = {2013},
}