Refine
Year of publication
Document Type
- Article (168)
- Other (11)
- Postprint (11)
- Monograph/Edited Volume (1)
- Conference Proceeding (1)
Keywords
- answer set programming (12)
- Answer set programming (7)
- Answer Set Programming (6)
- bioinformatics (3)
- Answer Set Programming (ASP) (2)
- Constraint Answer Set Programming (CASP) (2)
- Multi-objective optimization (2)
- Theory (2)
- Time series data (2)
- algorithm schedules (2)
- consistency (2)
- course timetabling (2)
- diagnosis (2)
- educational timetabling (2)
- portfolio-based solving (2)
- solver (2)
- Aggregates (1)
- Algorithm configuration (1)
- Algorithm portfolios (1)
- Architecture synthesis (1)
- Automated parallelization (1)
- Boolean Networks (1)
- Boolean logic models (1)
- Boolean networks (1)
- Combinatorial multi-objective optimization (1)
- Complex optimization (1)
- Conformant Planning (1)
- Constraint Processing (CP) (1)
- Constraint Programming (CP) (1)
- Course timetabling (1)
- Diverse solution enumeration (1)
- Educational timetabling (1)
- Epistemic Logic Programs (1)
- Incremental answer set programming (1)
- Knowledge representation (1)
- Localization (1)
- Logic programming (1)
- Meta-Programming (1)
- Minimal perturbation problems (1)
- Model checking (1)
- Model identification (1)
- Multiplex phosphoproteomics data (1)
- Non-Monotonic (1)
- Nonmonotonic reasoning (1)
- Parallel SAT solving (1)
- Preference Handling (1)
- Programming by optimization (1)
- Reasoning (1)
- Reconfigurable architecture (1)
- SAT (1)
- SMT (1)
- Sat Modulo Theories (SMT) (1)
- Signaling transduction networks (1)
- System design (1)
- Systems biology (1)
- Technology mapping (1)
- Theory Solving (1)
- Tracking (1)
- Wireless Sensor Networks (1)
- action and change (1)
- action language (1)
- algorithm (1)
- answer (1)
- answer set (1)
- automated guided vehicle routing (1)
- automated planning (1)
- belief merging (1)
- belief revision (1)
- biological network model (1)
- biological networks (1)
- car assembly operations (1)
- circuits (1)
- clause elimination (1)
- complex optimization (1)
- constraints (1)
- declarative problem solving (1)
- finite model computation (1)
- gap-filling (1)
- hybrid solving (1)
- knowledge representation and nonmonotonic reasoning (1)
- linear programming (1)
- logic (1)
- meta-programming (1)
- metabolic network (1)
- models (1)
- nested expressions (1)
- parallel execution (1)
- planning (1)
- platypus (1)
- preference handling (1)
- program encodings (1)
- proof complexity (1)
- propositional satisfiability (1)
- quantified logics (1)
- regulatory networks (1)
- sat (1)
- search (1)
- sets (1)
- strong equivalence (1)
- systems (1)
- systems biology (1)
- tableau calculi (1)
- technical notes and rapid communications (1)
- transduction (1)
Institute
- Institut für Informatik und Computational Science (163)
- Mathematisch-Naturwissenschaftliche Fakultät (11)
- Hasso-Plattner-Institut für Digital Engineering GmbH (5)
- Hasso-Plattner-Institut für Digital Engineering gGmbH (2)
- Institut für Mathematik (2)
- Extern (1)
- Potsdam Transfer - Zentrum für Gründung, Innovation, Wissens- und Technologietransfer (1)
- Sozialwissenschaften (1)
In recent years, there has been a large amount of disparate work concerning the representation and reasoning with qualitative preferential information by means of approaches to nonmonotonic reasoning. Given the variety of underlying systems, assumptions, motivations, and intuitions, it is difficult to compare or relate one approach with another. Here, we present an overview and classification for approaches to dealing with preference. A set of criteria for classifying approaches is given, followed by a set of desiderata that an approach might be expected to satisfy. A comprehensive set of approaches is subsequently given and classified with respect to these sets of underlying principles