publications_runte.bib

@inproceedings{runte12somet,
  author = {Runte, Wolfgang},
  title = {{E}nhancing {B}usiness {P}rocess {M}anagement with a
                  {C}onstraint-based {A}pproach},
  abstract = {In the 1980s rule-based systems became very popular
                  in the domain of expert systems. It soon became
                  apparent, that large rule-based systems causes
                  enormous maintenance problems, because of the lack
                  of separation between domain knowledge an control
                  strategy. Rules are declarative, weakly structured,
                  difficult to manage and maintain and should be
                  applied only in local contexts and with limited
                  use. For large rule bases the user can not be sure
                  if the problem is completely covered by the rules,
                  modifications often result in unwanted
                  consequences. For application in business process
                  management (BPM) rules became popular again, but the
                  known insufficiencies still remain. Today it seems
                  to be quite ignored that techniques using rules have
                  strucural drawbacks that limit their application
                  significantly. We present a constraint-based
                  approach to enhance process models with additional
                  knowledge. Constraints allow compact modeling of
                  decision processes to inference specific values in
                  process models. Furthermore constraints may be used
                  as mechanism for quality assurance (QA). Constraints
                  also have a declarative paradigma but avoid the lack
                  of separation between domain knowledge and control
                  strategy. Constraint solvers used as black box by a
                  process engine will merely compute an output based
                  on the given domain knowledge and return these as
                  new input for the process engine. The constraint
                  solver will give control as soon as possible back to
                  the process engine. The process engine exclusively
                  has to decide how to proceed. So constraints support
                  a process engine without competing for the control
                  strategy.},
  booktitle = {New Trends in Software Methodologies, Tools and
                  Techniques - Proceedings of the Eleventh SoMeT_12,
                  Genoa, Italy, September 26-28, 2012},
  editor = {Fujita, Hamido and Revetria, Roberto},
  publisher = {IOS Press},
  address = {Amsterdam, The Netherlands},
  series = {Frontiers in Artificial Intelligence and
                  Applications},
  number = {246},
  pages = {215--237},
  month = sep,
  year = {2012},
  isbn = {978-1-61499-124-3},
  issn = {0922-6389},
  doi = {10.3233/978-1-61499-125-0-215},
  url = {pub/runte12somet.pdf},
  urldate = {18. Januar 2013},
  url2 = {http://dx.doi.org/10.3233/978-1-61499-125-0-215},
  url3 = {http://www.somet.soft.iwate-pu.ac.jp/en/conference/index.html},
  url4 = {http://www.somet.soft.iwate-pu.ac.jp/somet_12/},
  url5 = {http://www.somet.soft.iwate-pu.ac.jp/somet_12/submission.html},
  url6 = {http://www.somet.soft.iwate-pu.ac.jp/somet_12/REGISTRATION.htm},
  url7 = {http://mindrevolver.com/roberto.revetria/Sito/SOMET_12.html},
  url8 = {http://mindrevolver.com/roberto.revetria/Sito/Program.html},
  url9 = {http://mindrevolver.com/roberto.revetria/Sito/Program_files/program_12b21.pdf},
  url10 = {http://www.somet.soft.iwate-pu.ac.jp/somet_12/tutorial.htm},
  url11 = {http://www.somet.soft.iwate-pu.ac.jp/somet_12/Tutorial2.htm},
  url12 = {http://mindrevolver.com/roberto.revetria/Sito/Tutorial.html},
  url13 = {http://web.me.com/roberto.revetria/Sito/SOMET_12.html},
  url14 = {http://web.me.com/roberto.revetria/Sito/Submission_Details.html},
  url15 = {http://www.informatik.uni-trier.de/~ley/db/conf/somet/somet2012.html#Runte12},
  url_alt1 = {http://www.booksonline.iospress.nl/Content/View.aspx?piid=32490},
  url_alt2 = {http://www.booksonline.iospress.nl/Content/View.aspx?piid=32473},
  url_home = {http://www.iospress.nl/book/new-trends-in-software-methodologies-tools-and-techniques-11/},
  mytype = {CONFERENCE}
}
@inproceedings{runte10pbmbi-gi,
  author = {Runte, Wolfgang},
  title = {{F}ormalizing {D}ependencies in {B}usiness {P}rocess
                  {M}odels {U}sing {C}onstraint {S}atisfaction
                  ({A}bstract)},
  abstract = {Compliance management tackles issues related to both
                  modelling and enforcement of business constraints in
                  enterprises. In the context of business process
                  management, we propose and describe the use of
                  constraint satisfaction problems as a formal mean
                  for representing these dependencies. We describe
                  different scenarios using constraint satisfaction
                  for the modelling of business processes and propose
                  different constraint categories to distinguish
                  between them. In order to illustrate this we give an
                  example for each of these constraint categories. In
                  the following we discuss which category of
                  constraints is useful modelling different problem
                  classes. Furthermore we discuss in this paper in
                  which cases it is adequate to model a dependency as
                  a constraint in general.},
  booktitle = {INFORMATIK 2010: Service Science -- Neue
                  Perspektiven f{\"u}r die Informatik, Band 2. 27.09.
                  - 01.10.2010, Leipzig, Proceedings},
  editor = {F{\"a}hnrich, Klaus-Peter and Franczyk, Bogdan},
  publisher = {Gesellschaft f{\"u}r Informatik},
  address = {Bonn},
  series = {GI-Edition - Lecture Notes in Informatics (LNI)},
  number = {P-176},
  pages = {610},
  month = sep,
  year = {2010},
  isbn = {978-3-88579-270-3},
  issn = {1617-5468},
  url = {pub/runte10pbmbi-gi_abstract.pdf},
  urldate = {18. M{\"a}rz 2011},
  url2 = {http://www.informatik2010.de/},
  url3 = {http://www.informatik2010.de/478.html},
  url4 = {http://www.informatik2010.de/fileadmin/informatik2010/templates/dokumente/JT10_Programm_Screen.pdf},
  url5 = {http://www.gi-ev.de/service/publikationen/lni/},
  url6 = {http://www.gi-ev.de/service/publikationen/lni/gi-edition-proceedings-2010/gi-edition-lecture-notes-in-informatics-lni-p-176.html},
  url7 = {http://subs.emis.de/LNI/Proceedings/Proceedings176/article6006.html},
  url8 = {http://www.informatik.uni-trier.de/~ley/db/conf/gi/gi2010-2.html#Runte10},
  url_alt1 = {http://subs.emis.de/LNI/Proceedings/Proceedings176/626.pdf},
  url_alt2 = {http://subs.emis.de/LNI/Proceedings/Proceedings176/P-176.pdf},
  url_home = {http://subs.emis.de/LNI/Proceedings/Proceedings176.html},
  mytype = {WORKSHOP}
}
@inproceedings{runte09bpmr-gi,
  author = {Runte, Wolfgang and El Kharbili, Marwane},
  title = {{C}onstraint {C}hecking for {B}usiness {P}rocess
                  {M}anagement},
  abstract = {Compliance management tackles issues related to both
                  modelling and enforcement of business constraints in
                  enterprises. In the context of business process
                  management, we propose and describe the use of
                  constraint satisfaction problems as a formal mean
                  for representing these business constraints. We
                  propose a multi-level constraint satisfaction
                  approach to handle different levels of abstraction
                  in business process modelling. We elaborate on the
                  modelling of compliance requirements using
                  constraint satisfaction and discuss implications of
                  this technique such as problem solving
                  strategies. This work shows that a certain class of
                  compliance problems which can be grounded to
                  constraint satisfaction problems can be solved
                  efficiently using the proposed approach.},
  booktitle = {INFORMATIK 2009: Im Focus das Leben. Beitr{\"a}ge
                  der 39. Jahrestagung der Gesellschaft f{\"u}r
                  Informatik e.V. (GI), 28.9. - 2.10.2009, L{\"u}beck,
                  Proceedings},
  editor = {Fischer, Stefan and Maehle, Erik and Reischuk,
                  R{\"u}diger},
  publisher = {Gesellschaft f{\"u}r Informatik},
  address = {Bonn},
  series = {GI-Edition - Lecture Notes in Informatics (LNI)},
  number = {P-154},
  pages = {4093--4103},
  month = sep,
  year = {2009},
  isbn = {978-3-88579-248-2},
  issn = {1617-5468},
  url = {pub/runte09bpmr-gi.pdf},
  urldate = {18. M{\"a}rz 2011},
  url2 = {http://www.informatik2009.de/},
  url3 = {http://www.informatik2009.de/workshops0.html},
  url4 = {http://www.informatik2009.de/fileadmin/informatik2009/Download/programmheft-informatik2009.pdf},
  url5 = {http://www.gi-ev.de/service/publikationen/lni/},
  url6 = {http://www.gi-ev.de/service/publikationen/lni/gi-edition-proceedings-2009/gi-edition-lecture-notes-in-informatics-lni-p-154.html},
  url7 = {http://subs.emis.de/LNI/Proceedings/Proceedings154/article2918.html},
  url8 = {http://www.informatik.uni-trier.de/~ley/db/conf/gi/gi2009.html#RunteK09},
  url9 = {http://www.bit.informatik.uni-kiel.de/bpmr-gi2009/},
  url_alt1 = {http://subs.emis.de/LNI/Proceedings/Proceedings154/gi-proc-154-377.pdf},
  url_alt2 = {http://subs.emis.de/LNI/Proceedings/Proceedings154/P-154.pdf},
  url_home = {http://subs.emis.de/LNI/Proceedings/Proceedings154.html},
  citeseerurl = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.8753},
  mytype = {WORKSHOP}
}
@inproceedings{runte09yrw-mbp,
  author = {Runte, Wolfgang},
  title = {{M}odelling and {S}olving {C}onfiguration {P}roblems
                  on {B}usiness {P}rocesses {U}sing a {M}ulti-{L}evel
                  {C}onstraint {S}atisfaction {A}pproach},
  abstract = {In this paper we present our ideas to apply
                  constraint satisfaction on business processes. We
                  propose a multi-level constraint satisfaction
                  approach to handle different levels of abstraction
                  in business process modelling.},
  booktitle = {Business Process, Service Computing and Intelligent
                  Service Management, BPSC 2009, ISM 2009, YRW-MBP
                  2009, March 23-25, 2009, Leipzig, Germany,
                  Proceedings},
  editor = {Abramowicz, Witold and Maciaszek, Leszek and
                  Kowalczyk, Ryszard and Speck, Andreas},
  publisher = {Gesellschaft f{\"u}r Informatik},
  address = {Bonn},
  series = {GI-Edition - Lecture Notes in Informatics (LNI)},
  number = {P-147},
  pages = {237--238},
  month = mar,
  year = {2009},
  isbn = {978-3-88579-241-3},
  issn = {1617-5468},
  url = {pub/runte09yrw-mbp.pdf},
  urldate = {18. M{\"a}rz 2011},
  url2 = {http://sabreconference.wifa.uni-leipzig.de/},
  url3 = {https://web.archive.org/web/20110108024838/https://sabreconference.wifa.uni-leipzig.de/frontend/index.php},
  url4 = {http://barkentine.informatik.uni-kiel.de/yrw09/media/CfP-YRW-MBP09.pdf},
  url5 = {http://www.gi-ev.de/service/publikationen/lni/},
  url6 = {http://www.gi-ev.de/service/publikationen/lni/gi-edition-proceedings-2009/gi-edition-lecture-notes-in-informatics-lni-p-147.html},
  url7 = {http://www.gi-ev.de/fileadmin/redaktion/2009_LNI/lni-p-147.pdf},
  url8 = {http://www.informatik.uni-trier.de/~ley/db/conf/bpsc/bpsc2009.html#Runte09},
  url_alt1 = {http://subs.emis.de/LNI/Proceedings/Proceedings147/gi-proc-147-022.pdf},
  url_alt2 = {http://subs.emis.de/LNI/Proceedings/Proceedings147/P-147.pdf},
  url_home = {http://subs.emis.de/LNI/Proceedings/Proceedings147.html},
  citeseerurl = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.6748},
  mytype = {WORKSHOP}
}
@inproceedings{runte07framework,
  author = {Runte, Wolfgang},
  title = {{E}in hybrides {F}ramework f{\"u}r
                  {C}onstraint-{S}olver zur {U}nterst{\"u}tzung
                  wissensbasierter {K}onfigurierung},
  abstract = {In wissensbasierten Konfigurierungssystemen werden
                  Komponenten zur Constraint-Verarbeitung f{\"u}r die
                  Verwaltung von Abh{\"a}ngigkeiten w{\"a}hrend des
                  Konfigurierungsprozesses eingesetzt. Die Effizienz
                  von Constraint-L{\"o}sungsverfahren ist allerdings
                  stark problemabh{\"a}ngig. Zudem kann es aufgrund
                  einer Vielzahl unterschiedlicher Dom{\"a}nen und der
                  Vielf{\"a}ltigkeit der Anwendungsszenarien notwendig
                  werden, an die jeweilige Dom{\"a}ne angepasste
                  Constraint-L{\"o}sungsverfahren einzusetzen. Zur
                  Behandlung von unterschiedlichen
                  Constraint-Dom{\"a}nen innerhalb des
                  strukturbasierten Konfigurierungswerkzeugs EngCon
                  sind Constraint-Solver sowohl f{\"u}r finite als
                  auch infinite Dom{\"a}nen erforderlich. Die
                  Steuerung muss durch eine Komponente geleistet
                  werden, mit der sich unterschiedliche
                  Constraint-Solver je nach Bedarf und
                  dom{\"a}nenspezifisch einsetzen lassen. Die
                  Modularit{\"a}t ist dabei entscheidend f{\"u}r die
                  Austauschbarkeit einzelner Komponenten. Es stellt
                  daher einen sinnvollen Ansatz dar, ein modulares
                  Constraint-Framework einzusetzen, in das je nach
                  Bedarf, und dem in der jeweiligen Wissensbasis
                  definiertem Problem, unterschiedliche
                  Constraint-Solver mit jeweils f{\"u}r das
                  spezifische Problem effizienten L{\"o}sungsverfahren
                  eingesetzt werden k{\"o}nnen. Das Framework wird
                  durch einen strategiebasierten Ansatz
                  unterst{\"u}tzt, der eine flexible Kooperation
                  unterschiedlicher Constraint-L{\"o}sungsalgorithmen
                  erlaubt.},
  booktitle = {Proceedings of the 21th Workshop Planen, Scheduling
                  und Konfigurieren, Entwerfen (PuK 2007) at the 30th
                  Annual German Conference on AI (KI 2007)},
  editor = {Edelkamp, Stefan and Sauer, J{\"u}rgen and
                  Schattenberg, Bernd},
  address = {Osnabr{\"u}ck},
  pages = {78--92},
  month = sep # { 10,},
  year = {2007},
  url = {pub/runte07framework.pdf},
  urldate = {18. M{\"a}rz 2011},
  url2 = {http://www.puk-workshop.de/},
  url3 = {http://www-is.informatik.uni-oldenburg.de/~sauer/puk/puk.html},
  url4 = {http://www.ki2007.uos.de/},
  url5 = {http://www.ki2007.uos.de/workshops.html#W3},
  url6 = {http://konferenz.kuenstliche-intelligenz.de/},
  url_alt1 = {http://www.puk-workshop.de/puk2007/paper/PuK07-Proceedings.pdf},
  url_home = {http://www.puk-workshop.de/puk2007/paper.html},
  mytype = {WORKSHOP}
}
@mastersthesis{runte06diplom,
  author = {Runte, Wolfgang},
  title = {{YACS}: {E}in hybrides {F}ramework f{\"u}r
                  {C}onstraint-{S}olver zur {U}nterst{\"u}tzung
                  wissensbasierter {K}onfigurierung},
  abstract = {In wissensbasierten Konfigurierungssystemen werden
                  Komponenten zur Constraint-Verarbeitung f{\"u}r die
                  Verwaltung von Abh{\"a}ngigkeiten w{\"a}hrend des
                  Konfigurierungsprozesses eingesetzt. Die Effizienz
                  von Constraint-L{\"o}sungsverfahren ist allerdings
                  stark problemabh{\"a}ngig. Zudem kann es aufgrund
                  einer Vielzahl unterschiedlicher Dom{\"a}nen und der
                  Vielf{\"a}ltigkeit der Anwendungsszenarien notwendig
                  werden, an die jeweilige Dom{\"a}ne angepasste
                  Constraint-L{\"o}sungsverfahren einzusetzen. Zur
                  Behandlung von unterschiedlichen
                  Constraint-Dom{\"a}nen innerhalb des
                  strukturbasierten Konfigurierungswerkzeugs EngCon
                  sind Constraint-Solver sowohl f{\"u}r finite als
                  auch infinite Dom{\"a}nen erforderlich. Die
                  Steuerung muss durch eine Komponente geleistet
                  werden, mit der sich unterschiedliche
                  Constraint-Solver je nach Bedarf und
                  dom{\"a}nenspezifisch einsetzen lassen. Die
                  Modularit{\"a}t ist dabei entscheidend f{\"u}r die
                  Austauschbarkeit einzelner Komponenten. Es stellt
                  daher einen sinnvollen Ansatz dar, ein modulares
                  Constraint-Framework einzusetzen, in das je nach
                  Bedarf, und dem in der jeweiligen Wissensbasis
                  definiertem Problem, unterschiedliche
                  Constraint-Solver mit jeweils f{\"u}r das
                  spezifische Problem effizienten L{\"o}sungsverfahren
                  eingesetzt werden k{\"o}nnen. Das Framework wird
                  durch einen strategiebasierten Ansatz
                  unterst{\"u}tzt, der eine flexible Kooperation
                  unterschiedlicher Constraint-L{\"o}sungsalgorithmen
                  erlaubt.},
  school = {University of Bremen},
  type = {Diploma {T}hesis},
  pages = {xx + 405},
  month = jan # { 27,},
  year = {2006},
  url = {pub/diplom/runte06diplom.pdf},
  urldate = {18. M{\"a}rz 2011},
  url_alt1 = {pub/diplom/runte06diplom-nolinks.pdf},
  url_dvi = {pub/diplom/runte06diplom.dvi},
  url_home = {pub/diplom/},
  url_html = {pub/diplom/html/index.html},
  url_html_targz = {pub/diplom/runte06diplom-html.tar.gz},
  url_project = {http://sourceforge.net/projects/constraints},
  url_psgz = {pub/diplom/runte06diplom.ps.gz},
  mytype = {THESIS}
}
@inproceedings{krebs03ijcai,
  author = {Krebs, Thorsten and Wagner, Thomas and Runte,
                  Wolfgang},
  title = {{R}ecognizing {U}ser {I}ntentions in {I}ncremental
                  {C}onfiguration {P}rocesses},
  abstract = {Increasing market demands concerning customer
                  requirements and market pressure from competitors
                  force several enterprises to diversify their product
                  range. Offering more and more product variants has
                  the implicit impact of growing development process
                  complexity. Although many configuration problems can
                  be solved with knowledge-based configuration, the
                  usage of configuration tools is very often
                  restricted to domain experts. In this paper we
                  extend knowledge-based configuration with a novel
                  plan recognition approach. We show that the
                  combination of configuration and plan recognition
                  simplifies the use of configuration tools for
                  non-configuration experts and non-domain experts.},
  booktitle = {Proceedings of the Workshop on Configuration at the
                  18th International Joint Conference on Artificial
                  Intelligence (IJCAI 2003)},
  editor = {Mailharro, Daniel},
  address = {Acapulco, Mexico},
  pages = {44--50},
  month = aug # { 11,},
  year = {2003},
  url = {pub/krebs03ijcai.pdf},
  urldate = {18. M{\"a}rz 2011},
  url2 = {http://kogs-www.informatik.uni-hamburg.de/publikationen/pub-krebs/IJCAI2003.pdf},
  url3 = {http://www2.ilog.com/ijcai-03/index.html},
  url4 = {http://www2.ilog.com/ijcai-03/Papers/IJCAI03-08.pdf},
  url5 = {http://ijcai.org/~ijcai03/1024/html/entrada.html},
  url6 = {http://ijcai.org/past/ijcai-03/1024/html/entrada.html},
  url7 = {http://ijcai.org/past/ijcai-03/1024/html/programWorkshop.html},
  url_home = {http://ijcai.org/past/ijcai-03/1024/index.html},
  citeseerurl = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.9482},
  mytype = {WORKSHOP}
}