Research map / Learning theory and algorithms / Combinatorial and search optimization
On the Computation of Paracoherent Answer Sets
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace full answer-set enumeration with Guess&Check | WASP paracoherent-answer-set computation · Semi-stable ASP competition instances | instances solved: 0 -> 68 | Helped |
| Replace full answer-set enumeration with Minimize | WASP paracoherent-answer-set computation · Semi-stable ASP competition instances | instances solved: 0 -> 78 | Helped |
| Replace full answer-set enumeration with Split | WASP paracoherent-answer-set computation · Semi-stable ASP competition instances | instances solved: 0 -> 78 | Helped |
| Use weak-constraint optimization instead of enumeration | WASP paracoherent-answer-set computation · Semi-stable ASP competition instances | instances solved: 0 -> 15 | Helped |
| Use Minimize or Split instead of Guess&Check | WASP paracoherent-answer-set computation · Semi-stable ASP competition instances | instances solved: 68 -> 78 | Helped |
| Use Split instead of Minimize | WASP semi-equilibrium computation · ASP competition instances | instances solved: 13 -> 18 | Helped |
| Apply semi-equilibrium rather than semi-stable semantics | WASP paracoherent-answer-set algorithms · ASP competition instances | instances solved | Hurt |
| Use Minimize rather than Filtering | WASP paracoherent-answer-set computation · Semi-equilibrium ASP competition instances | instances solved: 0 -> 13 | Helped |
| Use Split rather than Filtering | WASP paracoherent-answer-set computation · Semi-equilibrium ASP competition instances | instances solved: 0 -> 18 | Helped |
| Use Minimize rather than Split | WASP paracoherent-answer-set computation · Semi-stable ASP competition instances | instances solved: 78 -> 78 | No clear effect |
Closest papers by meaning
- Externally Supported Models for Efficient Computation of Paracoherent Answer Sets (AAAI 2018 · similarity 0.95)
- On Equivalence and Inconsistency of Answer Set Programs with External Sources (AAAI 2017 · similarity 0.88)
- Exact ASP Counting with Compact Encodings (AAAI 2024 · similarity 0.88)
- A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming (AAAI 2024 · similarity 0.88)
- On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? (AAAI 2024 · similarity 0.86)
- Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence (AAAI 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.