Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
From MaRDI portal
Publication:7323915
Cites work
- \textit{clingcon}: the next generation
- \texttt{eclingo}: a solver for epistemic logic programs
- A model building framework for answer set programming with external computations
- A new logical characterisation of stable models and answer sets
- Abstract gringo
- Advances in WASP
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- Answer Set Programming: A Primer
- ASP modulo CSP: the clingcon system
- ASSAT: computing answer sets of a logic program by SAT solvers
- Autoepistemic logic
- Blending lazy-grounding and CDNL search for answer-set solving
- Clingo goes linear constraints over reals and integers
- Complex optimization in answer set programming
- Complexity results for answer set programming with bounded predicate arities and implications
- Concise finite-domain representations for PDDL planning tasks
- Conflict-driven answer set solving: from theory to practice
- Constraint answer set solver EZCSP and why integration schemas matter
- Epistemic logic programs: a different world view
- Estimating grounding sizes of logic programs under answer set semantics
- Evaluating epistemic negation in answer set programming
- Evaluation of disjunctive programs in WASP
- Extending and implementing the stable model semantics
- GASP: Answer set programming with lazy grounding
- How to build your own ASP-based system?!
- scientific article; zbMATH DE number 5996835 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1470716 (Why is no real title available?)
- scientific article; zbMATH DE number 1884395 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Lazy model expansion: interleaving grounding with search
- Logic programming and knowledge representation---The A-Prolog perspective
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- lpopt: a rule optimization tool for answer set programming
- Manifold answer-set programs and their applications
- Multi-shot ASP solving with clingo
- Negation by default and unstratifiable logic programs
- On the computational cost of disjunctive logic programming: Propositional case
- On the foundations of grounding in answer set programming
- Optimizing answer set computation via heuristic-based decomposition
- Paracoherent answer set computation
- Partial compilation of ASP programs
- plasp 3: towards effective ASP planning
- Preprocessing of complex non-ground rules in answer set programming
- Progress in clasp series 3
- Revisiting Epistemic Specifications
- selp: a single-shot epistemic logic program solver
- Some (in)translatability results for normal logic programs and propositional theories
- Stable model semantics for founded bounds
- The Complexity of Enumeration and Reliability Problems
- The DLV system for knowledge representation and reasoning
- The fast downward planning system
- The impact of treewidth on grounding and solving of answer set programs
- The intelligent grounder of DLV
- The language of epistemic specifications (refined) including a prototype solver
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- The well-founded semantics for general logic programs
- Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Utilizing treewidth for quantitative reasoning on epistemic logic programs
This page was built for publication: Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7323915)
