Lazy atom discovery in compilation-based ASP solving
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- A deterministic prolog fixpoint semantics
- A logic-based question answering system for cultural heritage
- ASP modulo CSP: the clingcon system
- ASP-Core-2 input language format
- Advances in WASP
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- Answer set planning: a survey
- Blending lazy-grounding and CDNL search for answer-set solving
- Conflict generalisation in ASP: learning correct and effective non-ground constraints
- Constraint answer set solver EZCSP and why integration schemas matter
- Design and results of the Fifth Answer Set Programming Competition
- DualGrounder: lazy instantiation via clingo multi-shot framework
- GASP: Answer set programming with lazy grounding
- Lazy model expansion: interleaving grounding with search
- Modeling variations of first-order Horn abduction in answer set programming
- Nurse scheduling via answer set programming
- Partial compilation of ASP programs
- Semantics and complexity of recursive aggregates in answer set programming
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
- Stable model semantics for founded bounds
- Taming primary key violations to query large inconsistent data via ASP
- The ASP system DLV2
- The DLV system for knowledge representation and reasoning
- Tight logic programs
- Web reasoning and rule systems. 9th international conference, RR 2015, Berlin, Germany, August 4--5, 2015. Proceedings
This page was built for publication: Lazy atom discovery in compilation-based ASP solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884740)
