Gringo

swMATH4630MaRDI QIDQ16800FDOQ16800

Author name not available (Why is that?)

Described by source

• Abstract gringo

Cited In (only showing first 100 items - show all)

• Generating explanations for biomedical queries
• Search methods for tile sets in patterned DNA self-assembly
• A parallel memory-efficient epistemic logic program solver: harder, better, faster
• \texttt{eclingo}: a solver for epistemic logic programs
• Domain expansion for ASP-programs with external sources
• Modeling biological networks by action languages via answer set programming
• Relating two dialects of answer set programming
• One More Decidable Class of Finitely Ground Programs
• The return of \textit{xorro}
• Automatic Composition of Melodic and Harmonic Music by Answer Set Programming
• Extending the metabolic network of Ectocarpus siliculosus using answer set programming
• Stable-unstable semantics: Beyond NP with normal logic programs
• Knowledge-based multi-criteria optimization to support indoor positioning
• Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition
• Verifying Tight Logic Programs with anthem and vampire
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Reactive multi-context systems: heterogeneous reasoning in dynamic environments
• Constraint answer set programming systems
• Commonsense visual sensemaking for autonomous driving -- on generalised neurosymbolic online abduction integrating vision and semantics
• Achievements in answer set programming
• Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
• Dynamic magic sets and super-coherent answer set programs
• Detecting inconsistencies in large biological networks with answer set programming
• Fuzzy answer set computation via satisfiability modulo theories
• Checking termination of bottom-up evaluation of logic programs with function symbols
• Writing declarative specifications for clauses
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Temporal logic programs with variables
• Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
• Ricochet Robots reloaded: a case-study in multi-shot ASP solving
• Conflict-driven answer set solving: from theory to practice
• Magic sets for disjunctive Datalog programs
• Enhancing DLV instantiator by backjumping techniques
• Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming
• Title not available (Why is that?)
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Answer set programming
• Functional ASP with intensional sets: application to Gelfond-Zhang aggregates
• Approximate postdictive reasoning with answer set programming
• Multi-shot ASP solving with clingo
• Title not available (Why is that?)
• Debugging non-ground ASP programs: technique and graphical tools
• Partial compilation of ASP programs
• Optimizing answer set computation via heuristic-based decomposition
• Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
• ASP-Core-2 input language format
• Complexity-sensitive decision procedures for abstract argumentation
• Multi-criteria optimization in answer set programming
• DualGrounder: lazy instantiation via clingo multi-shot framework
• Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
• New models for generating hard random Boolean formulas and disjunctive logic programs
• Verifying strong equivalence of programs in the input language of \textsc{gringo}
• The Significance of Memory Costs in Answer Set Solver Implementation
• Arguing correctness of ASP programs with aggregates
• Backdoors to tractable answer set programming
• The intelligent grounder of DLV
• Gelfond-Zhang aggregates as propositional formulas
• Terminating evaluation of logic programs with finite three-valued models
• Inductive learning of answer set programs for autonomous surgical task planning. Application to a training task for surgeons
• Learning Boolean logic models of signaling networks with ASP
• Flexible combinatory categorial grammar parsing using the CYK algorithm and answer set programming
• Title not available (Why is that?)
• What is answer set programming to propositional satisfiability
• Tableau calculi for logic programs under answer set semantics
• Automated reasoning with restricted intensional sets
• A First Order Forward Chaining Approach for Answer Set Computing
• selp: a single-shot epistemic logic program solver
• Constraint Answer Set Solving
• The D-FLAT system for dynamic programming on tree decompositions
• Expressive power and abstraction in Essence
• \textit{clingcon}: the next generation
• Shared aggregate sets in answer set programming
• Taming primary key violations to query large inconsistent data via ASP
• Rewriting recursive aggregates in answer set programming: back to monotonicity
• Complexity results for answer set programming with bounded predicate arities and implications
• Infinitary equilibrium logic and strongly equivalent logic programs
• Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
• Title not available (Why is that?)
• Look-back techniques for ASP programs with aggregates
• Disjunctive ASP with functions: decidable queries and effective computation
• Toward Question Answering in Travel Domains
• Towards Verifying Logic Programs in the Input Language of clingo
• Intelligent Instantiation and Supersafe Rules
• Proving infinitary formulas
• A decidable subclass of finitary programs
• PBINT, a logic for modelling search problems involving arithmetic
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
• Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• Incremental answer set programming with overgrounding
• Accurate computation of sensitizable paths using answer set programming
• Symbolic system synthesis using answer set programming
• Justifications for logic programs under answer set semantics
• A trajectory calculus for qualitative spatial reasoning using answer set programming
• Train scheduling with hybrid answer set programming
• Strong Equivalence of Logic Programs with Counting
• Optimizing phylogenetic supertrees using answer set programming
• A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming
• Program completion in the input language of GRINGO
• Speed-up techniques for negation in grounding

This page was built for software: Gringo