clasp

swMATH7095MaRDI QIDQ19153FDOQ19153

Author name not available (Why is that?)

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

• Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
• Generating explanations for biomedical queries
• Modeling biological networks by action languages via answer set programming
• A Translation-based Approach to the Verification of Modular Equivalence
• Dynamic and Static Symmetry Breaking in Answer Set Programming
• Flexible Combinatory Categorial Grammar Parsing Using the CYK Algorithm and Answer Set Programming
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Lpopt: a rule optimization tool for answer set programming
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
• Automata and Answer Set Programming
• Logic programs with abstract constraint atoms: the role of computations
• Multi-threaded ASP solving with clasp
• Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving
• Stable-unstable semantics: Beyond NP with normal logic programs
• Scheduling reach mahjong tournaments using pseudoboolean constraints
• Efficiently Coupling the I-DLV Grounder with ASP Solvers
• Optimizing Answer Set Computation via Heuristic-Based Decomposition
• Boolean lexicographic optimization: algorithms \& applications
• Knowledge-based multi-criteria optimization to support indoor positioning
• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• The D-FLAT System for Dynamic Programming on Tree Decompositions
• Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs
• ASlib: a benchmark library for algorithm selection
• Partial Compilation of ASP Programs
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Rough set reasoning using answer set programs
• A Model for Phase Transition of Random Answer-Set Programs
• GASP: Answer Set Programming with Lazy Grounding
• Reactive multi-context systems: heterogeneous reasoning in dynamic environments
• Constraint answer set programming systems
• Paracoherent answer set computation
• Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
• Detecting inconsistencies in large biological networks with answer set programming
• The Seventh Answer Set Programming Competition: Design and Results
• A translational approach to constraint answer set solving
• Anytime answer set optimization via unsatisfiable core shrinking
• Checking termination of bottom-up evaluation of logic programs with function symbols
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Effectively Reasoning about Infinite Sets in Answer Set Programming
• Answer Set Programming Modulo Acyclicity
• Clingcon: The next generation
• A SAT Approach to Clique-Width
• Progress in clasp Series 3
• Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
• Conflict-driven answer set solving: from theory to practice
• Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
• Title not available (Why is that?)
• A framework for step-wise explaining how to solve constraint satisfaction problems
• Extending Removed Sets Revision to partially preordered belief bases
• Design and results of the Fifth Answer Set Programming Competition
• Iterative and core-guided maxsat solving: a survey and assessment
• New models for generating hard random Boolean formulas and disjunctive logic programs
• A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming
• Title not available (Why is that?)
• Backdoors to tractable answer set programming
• Computing Stable Models via Reductions to Difference Logic
• The External Interface for Extending WASP
• 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
• A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There
• Better Paracoherent Answer Sets with Less Resources
• Theorem proving as constraint solving with coherent logic
• Title not available (Why is that?)
• Meta-interpretive learning: application to grammatical inference
• Constraint-directed search for all-interval series
• What is answer set programming to propositional satisfiability
• Automatic construction of parallel portfolios via algorithm configuration
• Dualization of Boolean functions using ternary decision diagrams
• Constraint Answer Set Solving
• Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study
• Shared aggregate sets in answer set programming
• URSA: A System for Uniform Reduction to SAT
• Extending the Metabolic Network of Ectocarpus Siliculosus Using Answer Set Programming
• Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
• Boosting Answer Set Optimization with Weighted Comparator Networks
• Hybrid ASP-based Approach to Pattern Mining
• Look-back techniques for ASP programs with aggregates
• Diagnostic Reasoning for Robotics Using Action Languages
• Applying Visible Strong Equivalence in Answer-Set Program Transformations
• To Vladimir Lifschitz on His 65th Birthday
• Toward Question Answering in Travel Domains
• Encoding the Revision of Partially Preordered Information in Answer Set Programming
• Incremental Answer Set Programming with Overgrounding
• Beyond NP: Quantifying over Answer Sets
• Title not available (Why is that?)
• Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
• Hybrid metabolic network completion
• Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
• Coalition formation in social environments with logic-based agents1
• Justifications for logic programs under answer set semantics
• Multivalued action languages with constraints in CLP(FD)
• Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs
• Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP
• Automatic synthesis of optimal-size concentrators by answer set programming
• Symmetry Breaking for Distributed Multi-Context Systems
• Accurate Computation of Sensitizable Paths Using Answer Set Programming
• Symbolic System Synthesis Using Answer Set Programming
• Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
• Semantics for conditional literals via the SM operator
• Solving problems in the polynomial hierarchy with ASP(Q)

This page was built for software: clasp