Conflict-Driven Answer Set Enumeration
From MaRDI portal
Recommendations
Cited in
(55)- On the relation among answer set solvers
- Integrating answer set programming and constraint logic programming
- What is answer set programming to propositional satisfiability
- Conflict-driven answer set solving: from theory to practice
- Theorem proving as constraint solving with coherent logic
- Why-provenance information for RDF, rules, and negation
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- On look-ahead heuristics in disjunctive logic programming
- Enhancing DLV instantiator by backjumping techniques
- Enumeration of minimal models and MUSes in WASP
- The intelligent grounder of DLV
- Gearing up for effective ASP planning
- Toward Question Answering in Travel Domains
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- Using DDs for nearest neighbor optimization of quantum circuits
- Checking Reversibility of Boolean Functions
- Performance tuning in answer set programming
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- Integrating Inductive Definitions in SAT
- On minimal constraint networks
- Capturing Conflict and Confusion in CSP
- Dealing Automatically with Exceptions by Introducing Specificity in ASP
- Boolean lexicographic optimization: algorithms \& applications
- Computing weighted solutions in ASP: representation-based method vs. search-based method
- Knowledge-based multi-criteria optimization to support indoor positioning
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Constraint Answer Set Solving
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- scientific article; zbMATH DE number 2090539 (Why is no real title available?)
- Multi-threaded ASP solving with clasp
- Hybrid ASP-based approach to pattern mining
- Synthesizing Imperative Code from Answer Set Programming Specifications
- Dualization of Boolean functions using ternary decision diagrams
- Modular answer set programming as a formal specification language
- Preferred first-order answer set programs
- Answer set enumeration via assumption literals
- Model enumeration via assumption literals
- scientific article; zbMATH DE number 7121940
- Treewidth in non-ground answer set solving and alliance problems in graphs
- Index sets for finite normal predicate logic programs with function symbols
- Logic Programming and Nonmonotonic Reasoning
- Loop-separable programs and their first-order definability
- Engineering an Incremental ASP Solver
- Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells
- Solution Enumeration by Optimality in Answer Set Programming
- A general framework for preferences in answer set programming
- OuterCount: a first-level solution-counter for quantified Boolean formulas
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Weight constraint programs with evaluable functions
- On CNF conversion for SAT and SMT enumeration
- Constraint answer set programming: integrational and translational (or SMT-based) approaches
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
- Extended RDF: computability and complexity issues
- Modeling biological networks by action languages via answer set programming
This page was built for publication: Conflict-Driven Answer Set Enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425404)
