Conflict-Driven Answer Set Enumeration
From MaRDI portal
Publication:5425404
DOI10.1007/978-3-540-72200-7_13zbMath1149.68332OpenAlexW1584297074MaRDI QIDQ5425404
Torsten Schaub, Benjamin Kaufmann, André Neumann, Martin Gebser
Publication date: 13 November 2007
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72200-7_13
Related Items
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols, Performance Tuning in Answer Set Programming, 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, $$\#\exists $$ SAT: Projected Model Counting, Using $$\pi $$ DDs for Nearest Neighbor Optimization of Quantum Circuits, Checking Reversibility of Boolean Functions, On minimal constraint networks, Unnamed Item, Synthesizing Imperative Code from Answer Set Programming Specifications, Integrating Inductive Definitions in SAT, 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, Model enumeration in propositional circumscription via unsatisfiable core analysis, OuterCount: a first-level solution-counter for quantified Boolean formulas, ASP and subset minimality: enumeration, cautious reasoning and MUSes, On look-ahead heuristics in disjunctive logic programming, Enhancing DLV instantiator by backjumping techniques, 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, What is answer set programming to propositional satisfiability, Extended RDF: computability and complexity issues, Enumeration of minimal models and MUSes in WASP, Weight constraint programs with evaluable functions, Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs, Modular Answer Set Programming as a Formal Specification Language, Modeling biological networks by action languages via answer set programming, Dualization of Boolean functions using ternary decision diagrams, Multi-threaded ASP solving with clasp, Constraint Answer Set Solving, On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers, Why-provenance information for RDF, rules, and negation, Preferred First-Order Answer Set Programs, Conflict-driven answer set solving: from theory to practice, Loop-separable programs and their first-order definability, Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation, Hybrid ASP-based Approach to Pattern Mining, Dealing Automatically with Exceptions by Introducing Specificity in ASP, On the relation among answer set solvers, Integrating answer set programming and constraint logic programming, Vicious circle principle, aggregates, and formation of sets in ASP based languages, Engineering an Incremental ASP Solver, Theorem proving as constraint solving with coherent logic
Uses Software
