Institut für Informatik und Computational Science
Refine
Year of publication
Document Type
- Article (154)
- Other (7)
- Monograph/Edited Volume (1)
- Conference Proceeding (1)
Keywords
- answer set programming (6)
- Answer Set Programming (5)
- Answer set programming (5)
- Theory (2)
- bioinformatics (2)
- Aggregates (1)
- Algorithm configuration (1)
- Algorithm portfolios (1)
- Automated parallelization (1)
- Boolean logic models (1)
- Combinatorial multi-objective optimization (1)
- Complex optimization (1)
- Conformant Planning (1)
- Course timetabling (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)
- Multi-objective optimization (1)
- Non-Monotonic (1)
- Nonmonotonic reasoning (1)
- Parallel SAT solving (1)
- Preference Handling (1)
- Programming by optimization (1)
- Reasoning (1)
- Signaling transduction networks (1)
- Systems biology (1)
- Tracking (1)
- Wireless Sensor Networks (1)
- action and change (1)
- algorithm schedules (1)
- automated guided vehicle routing (1)
- automated planning (1)
- belief merging (1)
- belief revision (1)
- car assembly operations (1)
- consistency (1)
- course timetabling (1)
- declarative problem solving (1)
- diagnosis (1)
- educational timetabling (1)
- finite model computation (1)
- gap-filling (1)
- hybrid solving (1)
- knowledge representation and nonmonotonic reasoning (1)
- linear programming (1)
- metabolic network (1)
- portfolio-based solving (1)
- program encodings (1)
- proof complexity (1)
- strong equivalence (1)
- tableau calculi (1)
- technical notes and rapid communications (1)
Institute
We introduce a simple approach extending the input language of Answer Set Programming (ASP) systems by multi-valued propositions. Our approach is implemented as a (prototypical) preprocessor translating logic programs with multi-valued propositions into logic programs with Boolean propositions only. Our translation is modular and heavily benefits from the expressive input language of ASP. The resulting approach, along with its implementation, allows for solving interesting constraint satisfaction problems in ASP, showing a good performance.