| Publication | Date of Publication | Type |
|---|
| Abstracting soft constraints: framework, properties, examples | 2022-09-27 | Paper |
| Abstract graph derivations in the double pushout approach | 2022-08-16 | Paper |
| Note on standard representation of graphs and graph derivations | 2022-08-16 | Paper |
| Contextual occurrence nets and concurrent constraint programming | 2022-08-16 | Paper |
| Reasoning with PCP-Nets | 2022-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3388740 | 2021-05-06 | Paper |
| Cognitive hierarchy and voting manipulation in \(k\)-approval voting | 2021-04-26 | Paper |
| Gibbard-Satterthwaite games for \(k\)-approval voting rules | 2019-11-08 | Paper |
| Local search approaches in stable matching problems | 2019-03-26 | Paper |
| Stability, optimality and manipulation in matching problems with weighted preferences | 2019-03-26 | Paper |
| An event structure semantics for graph grammars with parallel productions | 2019-01-10 | Paper |
| Synchronized composition of graph grammar productions | 2019-01-10 | Paper |
| Soft concurrent constraint programming | 2017-07-12 | Paper |
| A Borda count for collective sentiment analysis | 2016-09-16 | Paper |
| Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loop | 2015-11-04 | Paper |
| Unicast and multicast QoS routing with soft-constraint logic programming | 2015-09-17 | Paper |
| Bribery in voting with CP-nets | 2014-02-25 | Paper |
| Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming | 2014-01-17 | Paper |
| Restricted Manipulation in Iterative Voting: Condorcet Efficiency and Borda Score | 2013-12-17 | Paper |
| Incompleteness and incomparability in preference aggregation: complexity results | 2011-11-17 | Paper |
| Interval-valued soft constraint problems | 2011-01-12 | Paper |
| Soft constraint problems with uncontrollable variables | 2011-01-06 | Paper |
| Constraint Logic Programming | 2010-07-20 | Paper |
| From soft constraints to bipolar preferences: modelling framework and solving issues | 2010-06-08 | Paper |
| Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies | 2010-05-07 | Paper |
| Compact Preference Representation in Stable Marriage Problems | 2009-11-17 | Paper |
| Robust Solutions in Unstable Optimization Problems | 2009-08-06 | Paper |
| Comparing the notions of optimality in CP-nets, strategic games and soft constraints | 2009-07-13 | Paper |
| Aggregating Partially Ordered Preferences | 2009-06-12 | Paper |
| Recent Advances in Constraints | 2009-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624044 | 2009-04-28 | Paper |
| Bipolar Preference Problems: Framework, Properties and Solving Techniques | 2009-03-05 | Paper |
| A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games | 2009-01-13 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Dealing with Incomplete Preferences in Soft Constraint Problems | 2008-09-02 | Paper |
| Semiring-Based Soft Constraints | 2008-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5435011 | 2008-01-14 | Paper |
| Constraint relaxation may be perfect | 2007-09-20 | Paper |
| Hard and soft constraints for reasoning about qualitative conditional preferences | 2006-09-28 | Paper |
| Logic Programming | 2006-06-27 | Paper |
| Symbolic and Quantitative Approaches to Reasoning with Uncertainty | 2006-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738345 | 2004-08-11 | Paper |
| An interactive semantics of logic programming | 2004-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424856 | 2003-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536717 | 2002-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537510 | 2002-07-01 | Paper |
| Soft constraint logic programming and generalized shortest path problems | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2736348 | 2001-08-29 | Paper |
| Graph rewriting, constraint solving and tiles for coordinating distributed systems | 2000-12-05 | Paper |
| Constraint retraction in CLP(FD): Formal framework and performance results | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4312458 | 1999-07-29 | Paper |
| Partial order and contextual net semantics for atomic and locally atomic CC programs | 1998-02-25 | Paper |
| Semiring-based constraint satisfaction and optimization | 1998-02-17 | Paper |
| Learning solution preferences in constraint problems | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688924 | 1997-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4890710 | 1996-08-25 | Paper |
| Contextual nets | 1995-11-20 | Paper |
| Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions | 1995-04-06 | Paper |
| Graph rewriting for a partial ordering semantics of concurrent constraints programming | 1994-10-31 | Paper |
| An abstract machine for concurrent modular systems: CHARM | 1994-02-22 | Paper |
| Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming | 1994-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037311 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3493317 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786030 | 1987-01-01 | Paper |
