Lpopt: a rule optimization tool for answer set programming

DOI10.1007/978-3-319-63139-4_7zbMath1485.68034arXiv1608.05675OpenAlexW2962726555MaRDI QIDQ2409731

Stefan Woltran, Manuel Bichler, Michael Morak

Publication date: 13 October 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.05675

zbMATH Keywords

tree decompositionlogic programminganswer set programmingpreprocessingrule decomposition

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (11)

Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Lpopt: a rule optimization tool for answer set programming ⋮ Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ A machine learning system to improve the performance of ASP solving based on encoding selection ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ Solving Advanced Argumentation Problems with Answer Set Programming ⋮ selp: A Single-Shot Epistemic Logic Program Solver ⋮ Estimating grounding sizes of logic programs under answer set semantics ⋮ Lpopt

Uses Software

• DLV
• clasp
• WASP
• Clingo
• GRAPPA
• htd
• GrappaVis
• DLV2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design and results of the Fifth Answer Set Programming Competition
• Treewidth computations. I: Upper bounds
• Conflict-driven answer set solving: from theory to practice
• Magic sets for disjunctive Datalog programs
• The ASP system DLV2
• Lpopt: a rule optimization tool for answer set programming
• Enhancing DLV instantiator by backjumping techniques
• Optimizing the Distributed Evaluation of Stratified Programs via Structural Analysis
• Progress in clasp Series 3
• Complexity of Finding Embeddings in a k-Tree
• The power of non-ground rules in Answer Set Programming
• Optimizing Answer Set Computation via Heuristic-Based Decomposition
• Solving Advanced Argumentation Problems with Answer Set Programming
• The DLV system for knowledge representation and reasoning
• Preprocessing of Complex Non-Ground Rules in Answer Set Programming
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Lpopt: a rule optimization tool for answer set programming