Research map / Learning theory and algorithms / Combinatorial and search optimization
Structural Decompositions of Epistemic Logic Programs
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.
Closest papers by meaning
- Strong Equivalence for Epistemic Logic Programs Made Easy (AAAI 2019 · similarity 0.93)
- Solving Epistemic Logic Programs Using Generate-and-Test with Propagation (AAAI 2025 · similarity 0.87)
- On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? (AAAI 2024 · similarity 0.87)
- Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence (AAAI 2025 · similarity 0.86)
- A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming (AAAI 2024 · similarity 0.85)
- An Algebraic Notion of Conditional Independence, and Its Application to Knowledge Representation (AAAI 2025 · similarity 0.84)
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.