The following pages link to Gringo (Q16800):
Displaying 50 items.
- The Significance of Memory Costs in Answer Set Solver Implementation (Q3395262) (← links)
- A decidable subclass of finitary programs (Q3585163) (← links)
- Disjunctive ASP with functions: Decidable queries and effective computation (Q3585164) (← links)
- Justifications for logic programs under answer set semantics (Q3612602) (← links)
- A First Order Forward Chaining Approach for Answer Set Computing (Q3643118) (← links)
- A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming (Q3643130) (← links)
- Shared aggregate sets in answer set programming (Q4559794) (← links)
- Cautious reasoning in ASP via minimal models and unsatisfiable cores (Q4559795) (← links)
- A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming (Q4559799) (← links)
- Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates (Q4559801) (← links)
- Program completion in the input language of GRINGO (Q4592711) (← links)
- Achievements in answer set programming (Q4592719) (← links)
- Generating explanations for biomedical queries (Q4592972) (← links)
- Rewriting recursive aggregates in answer set programming: back to monotonicity (Q4592997) (← links)
- Fuzzy answer set computation via satisfiability modulo theories (Q4592999) (← links)
- Optimizing phylogenetic supertrees using answer set programming (Q4593001) (← links)
- Taming primary key violations to query large inconsistent data via ASP (Q4593009) (← links)
- Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
- Stable-unstable semantics: Beyond NP with normal logic programs (Q4593043) (← links)
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) (Q4593048) (← links)
- Stable models for infinitary formulas with extensional atoms (Q4593057) (← links)
- Proving infinitary formulas (Q4593059) (← links)
- Temporal logic programs with variables (Q4593085) (← links)
- <tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing (Q4593088) (← links)
- <i>Clingcon</i>: The next generation (Q4593092) (← links)
- Constraint Answer Set Solving (Q4649733) (← links)
- (Q4906882) (← links)
- PBINT, A Logic for Modelling Search Problems Involving Arithmetic (Q4933335) (← links)
- Optimizing Answer Set Computation via Heuristic-Based Decomposition (Q4957190) (← links)
- Efficiently Coupling the I-DLV Grounder with ASP Solvers (Q4957193) (← links)
- ASP-Core-2 Input Language Format (Q4957196) (← links)
- selp: <i>A Single-Shot Epistemic Logic Program Solver</i> (Q4957201) (← links)
- Train Scheduling with Hybrid Answer Set Programming (Q4957222) (← links)
- (Q5020542) (← links)
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory (Q5038459) (← links)
- Strong Equivalence of Logic Programs with Counting (Q5038462) (← links)
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling (Q5038465) (← links)
- Towards Verifying Logic Programs in the Input Language of clingo (Q5049051) (← links)
- Partial Compilation of ASP Programs (Q5108506) (← links)
- Incremental Answer Set Programming with Overgrounding (Q5108513) (← links)
- Relating Two Dialects of Answer Set Programming (Q5108518) (← links)
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More (Q5140003) (← links)
- Verifying Tight Logic Programs with anthem and vampire (Q5140011) (← links)
- eclingo : A Solver for Epistemic Logic Programs (Q5140019) (← links)
- Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving (Q5172605) (← links)
- Multi-shot ASP solving with clingo (Q5197744) (← links)
- Debugging Non-ground ASP Programs: Technique and Graphical Tools (Q5197755) (← links)
- Answer Set Programming (Q5230475) (← links)
- Intelligent Instantiation and Supersafe Rules (Q5240211) (← links)
- (Q5282991) (← links)
