Conflict-driven answer set solving: from theory to practice

DOI10.1016/j.artint.2012.04.001zbMath1251.68060OpenAlexW2049791401MaRDI QIDQ1761291

Torsten Schaub, Martin Gebser, Benjamin Kaufmann

Publication date: 15 November 2012

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2012.04.001

zbMATH Keywords

nonmonotonic reasoning logic programming answer set programming

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items

Breaking symmetries with high dimensional graph invariants and their combination, Parallel Logic Programming: A Sequel, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods, Unnamed Item, Backdoors to Normality for Disjunctive Logic Programs, A Model for Phase Transition of Random Answer-Set Programs, Supportedly stable answer sets for logic programs with generalized atoms, Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving, Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems, Witnesses for Answer Sets of Logic Programs, A Neuro-Symbolic ASP Pipeline for Visual Question Answering, Inductive logic programming at 30, Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition, On abstract modular inference systems and solvers, Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version, Advances in WASP, Answer Set Programming Modulo Acyclicity, A Formal Theory of Justifications, Progress in clasp Series 3, Logic Programming with Graded Modality, The Design of the Sixth Answer Set Programming Competition, $$\#\exists $$ SAT: Projected Model Counting, SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers, Learning Boolean controls in regulated metabolic networks: a case-study, Exploiting Unfounded Sets for HEX-Program Evaluation, Shared aggregate sets in answer set programming, Cautious reasoning in ASP via minimal models and unsatisfiable cores, Improving the Normalization of Weight Rules in Answer Set Programs, Inductive Learning of Answer Set Programs, Lpopt: a rule optimization tool for answer set programming, Flexible FOND Planning with Explicit Fairness Assumptions, On the relation between SPARQL1.1 and Answer Set Programming, Many-valued dynamic object-oriented inheritance and approximations, A progression semantics for first-order logic programs, Stable reasoning, On the complexity of input/output logic, Model enumeration in propositional circumscription via unsatisfiable core analysis, Clingo goes linear constraints over reals and integers, Well-founded operators for normal hybrid MKNF knowledge bases, aspeed: Solver scheduling via answer set programming, Rewriting recursive aggregates in answer set programming: back to monotonicity, Complexity and compilation of GZ-aggregates in answer set programming, Fuzzy answer set computation via satisfiability modulo theories, A model building framework for answer set programming with external computations, The power of non-ground rules in Answer Set Programming, A Physician Advisory System for Chronic Heart Failure management based on knowledge patterns, The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description), ASPeRiX, a first-order forward chaining approach for answer set computing, Abstract Solvers for Computing Cautious Consequences of ASP programs, Better Paracoherent Answer Sets with Less Resources, On Uniform Equivalence of Epistemic Logic Programs, Inconsistency Proofs for ASP: The ASP - DRUPE Format, Design and results of the Fifth Answer Set Programming Competition, What is answer set programming to propositional satisfiability, Stepwise debugging of answer-set programs, Extended RDF: computability and complexity issues, Unnamed Item, Enumeration of minimal models and MUSes in WASP, IASCAR: incremental answer set counting by anytime refinement, A machine learning system to improve the performance of ASP solving based on encoding selection, QMaxSATpb: a certified MaxSAT solver, Efficient benchmarking of algorithm configurators via model-based surrogates, Constraint CNF: SAT and CSP Language Under One Roof., Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs, Unnamed Item, Unnamed Item, Rewriting optimization statements in answer-set programs, Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More, Incremental maintenance of overgrounded logic programs with tailored simplifications, Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints, A network model for routing-fault-free wavelength selection in WRONoCs design, The configurable SAT solver challenge (CSSC), Learning discrete decomposable graphical models via constraint optimization, Meta-interpretive learning: application to grammatical inference, An investigation of parametrized difference revision operators, Revising event calculus theories to recover from unexpected observations, Multi-shot ASP solving with clingo, Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms, Debugging Non-ground ASP Programs: Technique and Graphical Tools, A general approach to reasoning with probabilities, Inlining External Sources in Answer Set Programs, Hybrid ASP-based Approach to Pattern Mining, Optimizing Answer Set Computation via Heuristic-Based Decomposition, Efficiently Coupling the I-DLV Grounder with ASP Solvers, The External Interface for Extending WASP, selp: A Single-Shot Epistemic Logic Program Solver, Boosting Answer Set Optimization with Weighted Comparator Networks, Fixed point semantics for stream reasoning, Gelfond-Zhang aggregates as propositional formulas, SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers, DualGrounder: lazy instantiation via clingo multi-shot framework, A multi-shot ASP encoding for the aircraft routing and maintenance planning problem, Knowledge representation analysis of graph mining, A parallel memory-efficient epistemic logic program solver: harder, better, faster, A multiparametric view on answer set programming, Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search, Vicious circle principle, aggregates, and formation of sets in ASP based languages, Forgetting auxiliary atoms in forks, Learn to relax: integrating $0-1$ integer linear programming with pseudo-Boolean conflict-driven search, DynASP2.5: Dynamic Programming on Tree Decompositions in Action, Graph-based construction of minimal models, The dramatic true story of the frame default, Backdoors to tractable answer set programming, Assessing progress in SAT solvers through the Lens of incremental SAT

Uses Software

Cites Work