clasp

swMATH7095MaRDI QIDQ19153FDOQ19153

Author name not available (Why is that?)

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

• 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
• Extending the metabolic network of Ectocarpus siliculosus using answer set programming
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Lpopt: a rule optimization tool for answer set programming
• Answer set programming modulo acyclicity
• \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
• Progress in clasp series 3
• Multi-threaded ASP solving with clasp
• Effectively reasoning about infinite sets in answer set programming
• Stable-unstable semantics: Beyond NP with normal logic programs
• Combinatorial optimization solutions for the maximum quartet consistency problem
• Scheduling reach mahjong tournaments using pseudoboolean constraints
• Boolean lexicographic optimization: algorithms \& applications
• Knowledge-based multi-criteria optimization to support indoor positioning
• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs
• Better paracoherent answer sets with less resources
• A SAT approach to clique-width
• ASlib: a benchmark library for algorithm selection
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Rough set reasoning using answer set programs
• 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
• 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
• A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there
• 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
• A model for phase transition of random answer-set programs
• 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
• Iterative and core-guided maxsat solving: a survey and assessment
• URSA: a system for uniform reduction to SAT
• 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
• Dynamic and static symmetry breaking in answer set programming
• 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
• Theorem proving as constraint solving with coherent logic
• Flexible combinatory categorial grammar parsing using the CYK algorithm and answer set programming
• 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
• GASP: Answer set programming with lazy grounding
• Constraint Answer Set Solving
• The D-FLAT system for dynamic programming on tree decompositions
• \textit{clingcon}: the next generation
• Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study
• Shared aggregate sets in answer set programming
• Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
• Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
• Boosting Answer Set Optimization with Weighted Comparator Networks
• Look-back techniques for ASP programs with aggregates
• To Vladimir Lifschitz on His 65th Birthday
• Toward Question Answering in Travel Domains
• Encoding the Revision of Partially Preordered Information in Answer Set Programming
• Optimal scheduling for exposed datapath architectures with buffered processing units by ASP
• Multivalued action languages with constraints in \(CLP(FD)\)
• Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
• Hybrid metabolic network completion
• Answer set programming modulo acyclicity
• Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
• Coalition formation in social environments with logic-based agents1
• Hybrid ASP-based approach to pattern mining
• Symmetry breaking for distributed multi-context systems
• 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
• Learning and using domain-specific heuristics in ASP solvers
• Beyond NP: quantifying over answer sets
• Unsatisfiable core analysis and aggregates for optimum stable model search
• Diagnostic reasoning for robotics using action languages
• Automatic synthesis of optimal-size concentrators by 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